{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T14:46:22Z","timestamp":1773845182513,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,1,26]],"date-time":"2013-01-26T00:00:00Z","timestamp":1359158400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s10915-013-9682-3","type":"journal-article","created":{"date-parts":[[2013,1,25]],"date-time":"2013-01-25T19:55:51Z","timestamp":1359143751000},"page":"433-449","source":"Crossref","is-referenced-by-count":19,"title":["Exact Low-Rank Matrix Completion from Sparsely Corrupted Entries Via Adaptive Outlier Pursuit"],"prefix":"10.1007","volume":"56","author":[{"given":"Ming","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stanley","family":"Osher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,1,26]]},"reference":[{"issue":"3","key":"9682_CR1","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10208-005-0179-9","volume":"7","author":"PA Absil","year":"2006","unstructured":"Absil, P.A., Gallivan, K.A.: Trust-region methods on Riemannian manifolds. Found. Comput. Math. 7(3), 303\u2013330 (2006)","journal-title":"Found. Comput. Math."},{"key":"9682_CR2","unstructured":"Balzano, L., Nowak, R., Recht, B.: Online identification and tracking of subspaces from highly incomplete information. In: 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2010, pp. 704\u2013711 (2010)"},{"key":"9682_CR3","unstructured":"Boumal, N., Absil, P.A.: RTRMC: A Riemannian trust-region method for matrix completion. In: Twenty-Fifth Annual Conference on Neural Information Processing Systems, Grenade (2011)"},{"key":"9682_CR4","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J Cai","year":"2010","unstructured":"Cai, J., Cand\u00e8s, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20, 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"key":"9682_CR5","unstructured":"Cai, J., Osher, S.: Fast singular value thresholding without singular value decomposition. In: UCLA CAM Report, pp. 10\u201324 (2010)"},{"issue":"1","key":"9682_CR6","first-page":"1","volume":"58","author":"EJ Candes","year":"2009","unstructured":"Candes, E.J., Li, X., Ma, Y., Wright, J.: Robust principal component analysis? J. ACM 58(1), 1\u201337 (2009)","journal-title":"J. ACM"},{"key":"9682_CR7","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9, 717\u2013772 (2008)","journal-title":"Found. Comput. Math."},{"issue":"5","key":"9682_CR8","doi-asserted-by":"crossref","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"EJ Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s, E.J., Tao, T.: The power of convex relaxation: near-optimal matrix completion. IEEE Trans. Inf. Theory 56(5), 2053\u20132080 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"9682_CR9","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1109\/TIT.2011.2171521","volume":"58","author":"W Dai","year":"2012","unstructured":"Dai, W., Kerman, E., Milenkovic, O.: A geometric approach to low-rank matrix completion. IEEE Trans. Inf. Theory 58(1), 237\u2013247 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"9682_CR10","doi-asserted-by":"crossref","first-page":"3120","DOI":"10.1109\/TSP.2011.2144977","volume":"59","author":"W Dai","year":"2011","unstructured":"Dai, W., Milenkovic, O., Kerman, E.: Subspace evolution and transfer (SET) for low-rank matrix completion. IEEE Trans. Signal Process. 59(7), 3120\u20133132 (2011)","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"9682_CR11","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.acha.2011.06.001","volume":"32","author":"B Dong","year":"2012","unstructured":"Dong, B., Ji, H., Li, J., Shen, Z., Xu, Y.: Wavelet frame based blind image inpainting. Appl. Comput Harmon. Anal. 32(2), 155\u2013312 (2012)","journal-title":"Appl. Comput Harmon. Anal."},{"key":"9682_CR12","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718867","volume-title":"Matrix Methods in Data Mining and Pattern Recognition","author":"L Elden","year":"2007","unstructured":"Elden, L.: Matrix Methods in Data Mining and Pattern Recognition. Society for Industrial and Applied Mathematics, Philadephia (2007). doi: 10.1137\/1.9780898718867"},{"issue":"2","key":"9682_CR13","doi-asserted-by":"crossref","first-page":"4734","DOI":"10.1109\/ACC.2001.945730","volume":"6","author":"M Fazel","year":"2001","unstructured":"Fazel, M., Hindi, H., Boyd, H., Boyd, S.P.: A rank minimization heuristic with application to minimum order system approximation. Proc. 2001 Am. Control Conf. Cat No. 01CH37148 6(2), 4734\u20134739 (2001)","journal-title":"Proc. 2001 Am. Control Conf. Cat No. 01CH37148"},{"key":"9682_CR14","unstructured":"He, J., Balzano, L., Lui, J.C.S.: Online robust subspace tracking from partial information, arXiv: 1109.3827 (preprint) (2011)"},{"key":"9682_CR15","first-page":"937","volume":"23","author":"P Jain","year":"2010","unstructured":"Jain, P., Meka, R., Dhillon, I.: Guaranteed rank minimization via singular value projection. Adv. Neural Inf. Process. Syst. 23, 937\u2013945 (2010)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"4","key":"9682_CR16","first-page":"1112","volume":"4","author":"H Ji","year":"2012","unstructured":"Ji, H., Huang, S., Shen, Z., Xu, Y.: Robust video restoration by joint sparse and low rank matrix approximation. SIAM J. Imaging Sci. 4(4), 1112\u20131142 (2012)","journal-title":"SIAM J. Imaging Sci."},{"key":"9682_CR17","doi-asserted-by":"crossref","unstructured":"Ji, H., Liu, C., Shen, Z., Xu, Y.: Robust video denoising using low rank matrix completion. In: IEEE Conference in Computer Vision and Pattern Recognition (CVPR), San Francisco, CA (2010)","DOI":"10.1109\/CVPR.2010.5539849"},{"key":"9682_CR18","doi-asserted-by":"crossref","unstructured":"Keshavan, R., Montanari, A.: Regularization for matrix completion. In: 2010 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 1503\u20131507. Boston (2010)","DOI":"10.1109\/ISIT.2010.5513563"},{"issue":"6","key":"9682_CR19","doi-asserted-by":"crossref","first-page":"2980","DOI":"10.1109\/TIT.2010.2046205","volume":"56","author":"R Keshavan","year":"2010","unstructured":"Keshavan, R., Montanari, A., Oh, S.: Matrix completion from a few entries. IEEE Trans. Inf. Theory 56(6), 2980\u20132998 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9682_CR20","doi-asserted-by":"crossref","unstructured":"Keshavan, R.H., Montanari, A., Oh, S.: Low-rank matrix completion with noisy observations: a quantitative comparison. In: Proceedings of the 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton\u201909, pp. 1216\u20131222. IEEE Press, Los Alamitos (2009)","DOI":"10.1109\/ALLERTON.2009.5394534"},{"key":"9682_CR21","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01200757","volume":"15","author":"N Linial","year":"1995","unstructured":"Linial, N., London, E., Rabinovich, Y.: The geometry of graphs and some of its algorithmic applications. Combinatorica 15, 215\u2013245 (1995)","journal-title":"Combinatorica"},{"issue":"1\u20132","key":"9682_CR22","first-page":"73","volume":"128","author":"S Ma","year":"2011","unstructured":"Ma, S., Goldfarb, D., Chen, L.: Fixed point and Bregman iterative methods for matrix rank minimization. Math. Program. 128(1\u20132), 73\u2013122 (2011)","journal-title":"Math. Program."},{"key":"9682_CR23","unstructured":"Meyer, G., Bonnabel, S., Sepulchre, R.: Linear regression under fixed-rank constraints: a Riemannian approach. In: 28th International Conference on Machine Learning (ICML), Washington (2011)"},{"issue":"3","key":"9682_CR24","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parrilo, P.A.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52(3), 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"issue":"3","key":"9682_CR25","first-page":"1","volume":"117543","author":"KC Toh","year":"2009","unstructured":"Toh, K.C., Yun, S.: An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems. Engineering 117543(3), 1\u201331 (2009)","journal-title":"Engineering"},{"key":"9682_CR26","unstructured":"Vandereycken, B.: Low-rank matrix completion by Riemannian optimization (preprint) (2011)"},{"key":"9682_CR27","unstructured":"Waters, A.E., Sankaranarayanan, A.C., Baraniuk, R.G.: Sparcs: Recovering low-rank and sparse matrices from compressive measurements. In: Neural Information Processing Systems (NIPS). Granada, Spain (2011)"},{"key":"9682_CR28","unstructured":"Wen, Z., Yin, W., Zhang, Y.: Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm. Rice University CAAM Technical Report TR1007, pp. 1\u201324 (2010)"},{"key":"9682_CR29","unstructured":"Yan, M.: Restoration of images corrupted by impulse noise using blind inpainting and $$\\ell _0$$ norm, UCLA CAM Report 11-72 (under review) (2011)"},{"issue":"7","key":"9682_CR30","doi-asserted-by":"crossref","first-page":"3868","DOI":"10.1109\/TSP.2012.2193397","volume":"60","author":"M Yan","year":"2012","unstructured":"Yan, M., Yang, Y., Osher, S.: Robust 1-bit compressive sensing using adaptive outlier pursuit. IEEE Trans. Signal Process. 60(7), 3868\u20133875 (2012)","journal-title":"IEEE Trans. Signal Process."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-013-9682-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10915-013-9682-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-013-9682-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T08:45:42Z","timestamp":1559465142000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10915-013-9682-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,26]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["9682"],"URL":"https:\/\/doi.org\/10.1007\/s10915-013-9682-3","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,26]]}}}