{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T10:43:10Z","timestamp":1747219390389},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387081"},{"type":"electronic","value":"9783642387098"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40991-2_12","type":"book-chapter","created":{"date-parts":[[2013,8,28]],"date-time":"2013-08-28T05:43:57Z","timestamp":1377668637000},"page":"177-193","source":"Crossref","is-referenced-by-count":13,"title":["Minimal Shrinkage for Noisy Data Recovery Using Schatten-p Norm Objective"],"prefix":"10.1007","author":[{"given":"Deguang","family":"Kong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J. Cai","year":"2010","unstructured":"Cai, J., Cand\u00e8s, E., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM Journal on Optimization\u00a020, 1956\u20131982 (2010)","journal-title":"SIAM Journal on Optimization"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1145\/2184319.2184343","volume":"55","author":"E. Cand\u00e8s","year":"2012","unstructured":"Cand\u00e8s, E., Recht, B.: Exact matrix completion via convex optimization. Communications of the ACM\u00a055, 111\u2013119 (2012)","journal-title":"Communications of the ACM"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B. Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parrilo, P.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Review\u00a052, 471\u2013501 (2010)","journal-title":"SIAM Review"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Rennie, J.M., Srebro, N.: Fast maximum margin matrix factorization for collaborative prediction. In: ICML, pp. 713\u2013719 (2005)","DOI":"10.1145\/1102351.1102441"},{"key":"12_CR5","first-page":"803","volume":"10","author":"J. Abernethy","year":"2009","unstructured":"Abernethy, J., Bach, F., Evgeniou, T., Paristech, M., Jaakkola, T.: A new approach to collaborative filtering: Operator estimation with spectral regularization. Journal of Machine Learning Research\u00a010, 803\u2013826 (2009)","journal-title":"Journal of Machine Learning Research"},{"key":"12_CR6","unstructured":"Liu, J., Musialski, P., Wonka, P., Ye, J.: Tensor completion for estimating missing values in visual data. In: ICCV, pp. 2114\u20132121 (2009)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Jolliffe, I.: Principal Component Analysis. Springer (1986)","DOI":"10.1007\/978-1-4757-1904-8"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"D. Donoho","year":"2006","unstructured":"Donoho, D.: Compressed sensing. IEEE Transactions on Information Theory\u00a052, 1289\u20131306 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Ding, C.H.Q., Zhou, D., He, X., Zha, H.: R 1-pca: rotational invariant l 1-norm principal component analysis for robust subspace factorization. In: ICML, pp. 281\u2013288 (2006)","DOI":"10.1145\/1143844.1143880"},{"key":"12_CR10","unstructured":"Wright, J., Ganesh, A., Rao, S., Peng, Y., Ma, Y.: Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization. In: NIPS (2009)"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Peng, Y., Ganesh, A., Wright, J., Xu, W., Ma, Y.: Rasl: Robust alignment by sparse and low-rank decomposition for linearly correlated images. In: CVPR, pp. 763\u2013770 (2010)","DOI":"10.1109\/CVPR.2010.5540138"},{"key":"12_CR12","unstructured":"Fazel, M.: Matrix rank minimization with applications. PhD thesis, Stanford University, pp. 1\u2013130 (2002)"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"E. Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s, E., Tao, T.: The power of convex relaxation: near-optimal matrix completion. IEEE Transactions on Information Theory\u00a056, 2053\u20132080 (2010)","journal-title":"IEEE Transactions on Information Theory"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Chandrasekaran, V., Sanghavi, S., Parrilo, P., Willsky, A.: Sparse and low-rank matrix decompositions. In: Allerton 2009 Proceedings of the 47th Annual Allerton Conference on Communication, Control, and Computing, pp. 962\u2013967 (2009)","DOI":"10.1109\/ALLERTON.2009.5394889"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10107-009-0306-5","volume":"128","author":"S. Ma","year":"2011","unstructured":"Ma, S., Goldfarb, D., Chen, L.: Fixed point and bregman iterative methods for matrix rank minimization. Mathematical Programming: Series A and B\u00a0128, 321\u2013353 (2011)","journal-title":"Mathematical Programming: Series A and B"},{"key":"12_CR16","unstructured":"Toh, K., Yun, S.: An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems. Pacific Journal of Optimization (2010)"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"3465","DOI":"10.1137\/090763184","volume":"20","author":"T. Pong","year":"2010","unstructured":"Pong, T., Tseng, P., Ji, S., Ye, J.: Trace norm regularization: Reformulations, algorithms, and multi-task learning. SIAM Journal on Optimization\u00a020, 3465\u20133489 (2010)","journal-title":"SIAM Journal on Optimization"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/BF02163027","volume":"14","author":"G.H. Golub","year":"1970","unstructured":"Golub, G.H., Reinsch, C.: Singular value decomposition and least squares solutions. Numerische Mathematik\u00a014, 403\u2013420 (1970)","journal-title":"Numerische Mathematik"},{"key":"12_CR19","unstructured":"Lin, Z., Chen, M., Ma, Y.: The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices. In: UIUC Tech. Rep., UILU-ENG-09-2214 (2010)"},{"key":"12_CR20","unstructured":"Bertsekas, D.: Constrained Optimization and Lagrange Multiplier Methods. Athena Scientific (1996)"},{"key":"12_CR21","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R. Tibshirani","year":"1994","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society, Series B\u00a058, 267\u2013288 (1994)","journal-title":"Journal of the Royal Statistical Society, Series B"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Argyriou, A., Micchelli, C., Pontil, M., Ying, Y.: A spectral regularization framework for multi-task structure learning. In: NIPS (2007)","DOI":"10.2139\/ssrn.1031158"},{"key":"12_CR23","unstructured":"Jain, P., Meka, R., Dhillon, I.: Guaranteed rank minimization via singular value projection. In: NIPS (2010)"},{"key":"12_CR24","unstructured":"Nie, F., Huang, H., Ding, C.: Low-rank matrix recovery via efficient schatten p-norm minimization. In: Twenty-Sixth AAAI Conference on Artificial Intelligence (2012)"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Mohan, K., Fazel, M.: Iterative reweighted least squares for matrix rank minimization. In: 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 653\u2013661. IEEE (2010)","DOI":"10.1109\/ALLERTON.2010.5706969"},{"key":"12_CR26","first-page":"2057","volume":"11","author":"R. Keshavan","year":"2010","unstructured":"Keshavan, R., Montanari, A., Oh, S.: Matrix completion from noisy entries. The Journal of Machine Learning Research\u00a011, 2057\u20132078 (2010)","journal-title":"The Journal of Machine Learning Research"},{"key":"12_CR27","unstructured":"Wipf, D.: Non-convex rank minimization via an empirical bayesian approach. In: UAI, pp. 914\u2013923 (2012)"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Georghiades, A., Belhumeur, P., Kriegman, D.: From few to many: Illumination cone models for face recognition under variable lighting and pose. PAMI, 643\u2013660 (2001)","DOI":"10.1109\/34.927464"},{"key":"12_CR29","doi-asserted-by":"crossref","unstructured":"Lecun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proceedings of the IEEE, 2278\u20132324 (1998)","DOI":"10.1109\/5.726791"}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40991-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T09:43:01Z","timestamp":1715938981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40991-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387081","9783642387098"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40991-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}