{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T16:37:13Z","timestamp":1732034233370},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,7,13]],"date-time":"2012-07-13T00:00:00Z","timestamp":1342137600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s12532-012-0044-1","type":"journal-article","created":{"date-parts":[[2012,7,12]],"date-time":"2012-07-12T11:26:05Z","timestamp":1342092365000},"page":"333-361","source":"Crossref","is-referenced-by-count":515,"title":["Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm"],"prefix":"10.1007","volume":"4","author":[{"given":"Zaiwen","family":"Wen","sequence":"first","affiliation":[]},{"given":"Wotao","family":"Yin","sequence":"additional","affiliation":[]},{"given":"Yin","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,7,13]]},"reference":[{"key":"44_CR1","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A. Beck","year":"2009","unstructured":"Beck A., Teboulle M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2, 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"44_CR2","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1109\/JPROC.2009.2035722","volume":"98","author":"E. Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s E., Plan Y.: Matrix completion with noise. Proc. IEEE 98, 925\u2013936 (2010)","journal-title":"Proc. IEEE"},{"key":"44_CR3","doi-asserted-by":"crossref","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. (2009)","DOI":"10.1007\/s10208-009-9045-5"},{"key":"44_CR4","doi-asserted-by":"crossref","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"E.J. 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, 2053\u20132080 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"89","key":"44_CR5","first-page":"67","volume":"88","author":"T.F. Chan","year":"1987","unstructured":"Chan T.F.: Rank revealing QR factorizations. Linear Algebra Appl. 88(89), 67\u201382 (1987)","journal-title":"Linear Algebra Appl."},{"key":"44_CR6","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1002\/nla.1680010105","volume":"1","author":"T.F. Chan","year":"1994","unstructured":"Chan T.F., Hansen P.C.: Low-rank revealing QR factorizations. Numer. Linear Algebra Appl. 1, 33\u201344 (1994)","journal-title":"Numer. Linear Algebra Appl."},{"key":"44_CR7","doi-asserted-by":"crossref","unstructured":"Dai, W., Milenkovic, O.: Set an algorithm for consistent matrix completion CoRR. abs\/0909.2705 (2009)","DOI":"10.1109\/ICASSP.2010.5495899"},{"key":"44_CR8","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718867","volume-title":"Matrix Methods in Data Mining and Pattern Recognition (Fundamentals of Algorithms)","author":"L. Eld\u00e9n","year":"2007","unstructured":"Eld\u00e9n L.: Matrix Methods in Data Mining and Pattern Recognition (Fundamentals of Algorithms). Society for Industrial and Applied Mathematics, Philadelphia (2007)"},{"key":"44_CR9","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1023\/A:1011419012209","volume":"4","author":"K. Goldberg","year":"2001","unstructured":"Goldberg K., Roeder T., Gupta D., Perkins C.: Eigentaste A constant time collaborative filtering algorithm. Inf. Retr. 4, 133\u2013151 (2001)","journal-title":"Inf. Retr."},{"key":"44_CR10","doi-asserted-by":"crossref","unstructured":"Goldfarb, D., Ma, S., Wen, Z.: Solving low-rank matrix completion problems efficiently. In: Proceedings of the 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton\u201909, pp. 1013\u20131020 (2009)","DOI":"10.1109\/ALLERTON.2009.5394884"},{"key":"44_CR11","volume-title":"Matrix computations. In: Johns Hopkins Studies in the Mathematical Sciences","author":"G.H. Golub","year":"1996","unstructured":"Golub G.H., Van Loan C.F.: Matrix computations. In: Johns Hopkins Studies in the Mathematical Sciences, 3rd edn. Johns Hopkins University Press, Baltimore (1996)","edition":"3"},{"key":"44_CR12","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0167-6377(99)00074-7","volume":"26","author":"L. Grippo","year":"2000","unstructured":"Grippo L., Sciandrone M.: On the convergence of the block nonlinear Gauss\u2013Seidel method under convex constraints. Oper. Res. Lett. 26, 127\u2013136 (2000)","journal-title":"Oper. Res. Lett."},{"key":"44_CR13","unstructured":"Gross, D.: Recovering low-rank matrices from few coefficients in any basis, tech. rep. Leibniz University (2009)"},{"key":"44_CR14","doi-asserted-by":"crossref","unstructured":"Herlocker, J.L., Konstan, J.A., Borchers, A., Riedl, J.: An algorithmic framework for performing collaborative filtering. In: SIGIR \u201999: Proceedings of the 22nd annual international ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 230\u2013237. ACM, New York (1999)","DOI":"10.1145\/312624.312682"},{"key":"44_CR15","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"C. Jian-Feng","year":"2010","unstructured":"Jian-Feng C., Candes E.J., Zuowei S.: A singular value thresholding algorithm for matrix completion export. SIAM J. Optim. 20, 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"key":"44_CR16","doi-asserted-by":"crossref","first-page":"2980","DOI":"10.1109\/TIT.2010.2046205","volume":"56","author":"R.H. Keshavan","year":"2010","unstructured":"Keshavan R.H., Montanari A., Oh S.: Matrix completion from a few entries. IEEE Trans. Inform. Theory 56, 2980\u20132998 (2010)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"44_CR17","first-page":"2057","volume":"99","author":"R.H. Keshavan","year":"2010","unstructured":"Keshavan R.H., Montanari A., Oh S.: Matrix completion from noisy entries. J. Mach. Learn. Res. 99, 2057\u20132078 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"44_CR18","unstructured":"Keshavan, R.H., Oh, S.: A gradient descent algorithm on the grassman manifold for matrix completion, tech. rep., Dept. of Electrical Engineering, Stanford University (2009)"},{"key":"44_CR19","unstructured":"Larsen, R.M.: PROPACK Software for large and sparse svd calculations. http:\/\/soi.stanford.edu\/rmunk\/PROPACK"},{"key":"44_CR20","doi-asserted-by":"crossref","first-page":"4402","DOI":"10.1109\/TIT.2010.2054251","volume":"56","author":"K. Lee","year":"2010","unstructured":"Lee K., Bresler Y.: Admira atomic decomposition for minimum rank approximation. IEEE Trans. Inf. Theor. 56, 4402\u20134416 (2010)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"1\u20132","key":"44_CR21","first-page":"399","volume":"133","author":"Y.-J. Liu","year":"2011","unstructured":"Liu Y.-J., Sun D., Toh K.-C.: An implementable proximal point algorithmic framework for nuclear norm minimization. Math. Program. 133(1\u20132), 399\u2013436 (2011)","journal-title":"Math. Program."},{"key":"44_CR22","doi-asserted-by":"crossref","first-page":"1235","DOI":"10.1137\/090755436","volume":"31","author":"Z. Liu","year":"2009","unstructured":"Liu Z., Vandenberghe L.: Interior-point method for nuclear norm approximation with application to system identification. SIAM J. Matrix Anal. Appl. 31, 1235\u20131256 (2009)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"44_CR23","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF00939948","volume":"72","author":"Q.Z. Luo","year":"1992","unstructured":"Luo Q.Z., Tseng P.: On the convergence of the coordinate descent method for convex differentiable minimization. J. Optim. Theory Appl. 72, 7\u201335 (1992)","journal-title":"J. Optim. Theory Appl."},{"issue":"1\u20132","key":"44_CR24","first-page":"321","volume":"128","author":"S. Ma","year":"2009","unstructured":"Ma S., Goldfarb D., Chen L.: Fixed point and bregman iterative methods for matrix rank minimization. Math. Program. 128(1\u20132), 321\u2013353 (2009)","journal-title":"Math. Program."},{"key":"44_CR25","volume-title":"Regularization methods for learning incomplete matrices","author":"R. Mazumder","year":"2009","unstructured":"Mazumder R., Hastie T., Tibshirani R.: Regularization methods for learning incomplete matrices. Stanford University, tech. rep. (2009)"},{"key":"44_CR26","unstructured":"Meka, R., Jain, P., Dhillon, I.S.: Guaranteed rank minimization via singular value projection. CoRR, abs\/0909.5457 (2009)"},{"key":"44_CR27","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1109\/34.608289","volume":"19","author":"T. Morita","year":"1997","unstructured":"Morita T., Kanade T.: A sequential factorization method for recovering shape and motion from image streams. IEEE Trans. Pattern Anal. Mach. Intell. 19, 858\u2013867 (1997)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"44_CR28","volume-title":"Numerical Optimization. Springer Series in Operations Research and Financial Engineering","author":"J. Nocedal","year":"2006","unstructured":"Nocedal J., Wright S.J.: Numerical Optimization. Springer Series in Operations Research and Financial Engineering. Springer, Berlin (2006)"},{"key":"44_CR29","unstructured":"Recht, B.: A simpler approach to matrix completion. J. Mach. Learn. Res. (2010)"},{"key":"44_CR30","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, 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"key":"44_CR31","unstructured":"Shen, Y., Wen, Z., Zhang, Y.: Augmented lagrangian alternating direction method for matrix separation based on low-rank factorization, tech. rep. Rice University (2010)"},{"key":"44_CR32","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/0117004","volume":"17","author":"G.W. Stewart","year":"1969","unstructured":"Stewart G.W.: On the continuity of the generalized inverse. SIAM J. Appl. Math. 17, 33\u201345 (1969)","journal-title":"SIAM J. Appl. Math."},{"key":"44_CR33","first-page":"615","volume":"6","author":"K.-C. Toh","year":"2010","unstructured":"Toh K.-C., Yun S.: An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems. Pacific J. Optim. 6, 615\u2013640 (2010)","journal-title":"Pacific J. Optim."},{"key":"44_CR34","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF00129684","volume":"9","author":"C. Tomasi","year":"1992","unstructured":"Tomasi C., Kanade T.: Shape and motion from image streams under orthography: a factorization method. Int. J. Comput. Vis. 9, 137\u2013154 (1992)","journal-title":"Int. J. Comput. Vis."},{"key":"44_CR35","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0328011","volume":"28","author":"P. Tseng","year":"1990","unstructured":"Tseng P.: Dual ascent methods for problems with strictly convex costs and linear constraints: a unified approach. SIAM J. Control Optim. 28, 214\u2013242 (1990)","journal-title":"SIAM J. Control Optim."},{"key":"44_CR36","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1023\/A:1017501703105","volume":"109","author":"P. Tseng","year":"2001","unstructured":"Tseng P.: Convergence of a block coordinate descent method for nondifferentiable minimization. J. Optim. Theory Appl. 109, 475\u2013494 (2001)","journal-title":"J. Optim. Theory Appl."},{"key":"44_CR37","unstructured":"Xu, Y., Yin, W., Wen, Z., Zhang, Y.: An alternating direction algorithm for matrix completion with nonnegative factors. tech. rep., Shanghai Jiaotong University (2011)"},{"key":"44_CR38","unstructured":"Yang, J., Yuan, X.: An inexact alternating direction method for trace norm regularized least squares problem. tech. rep., Dept. of Mathematics. Nanjing University (2010)"},{"key":"44_CR39","unstructured":"Yuan, X., Yang, J.: Sparse and low-rank matrix decomposition via alternating direction methods. tech. rep. Dept. of Mathematics, Hong Kong Baptist University (2009)"},{"key":"44_CR40","unstructured":"Zhang, Y.: LMaFit Low-rank matrix fitting (2009). http:\/\/www.caam.rice.edu\/optimization\/L1\/LMaFit\/"},{"key":"44_CR41","unstructured":"Zhang, Y.: An alternating direction algorithm for nonnegative matrix factorization. tech. rep. Rice University (2010)"},{"key":"44_CR42","unstructured":"Zhu, Z., So, A.M.-C., Ye, Y.: Fast and near-optimal matrix completion via randomized basis pursuit, tech. rep. Stanford University (2009)"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-012-0044-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-012-0044-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-012-0044-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,30]],"date-time":"2019-06-30T21:29:11Z","timestamp":1561930151000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-012-0044-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,13]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["44"],"URL":"https:\/\/doi.org\/10.1007\/s12532-012-0044-1","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,13]]}}}