{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T23:05:27Z","timestamp":1782169527228,"version":"3.54.5"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,4,21]],"date-time":"2013-04-21T00:00:00Z","timestamp":1366502400000},"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":[[2013,6]]},"DOI":"10.1007\/s12532-013-0053-8","type":"journal-article","created":{"date-parts":[[2013,4,20]],"date-time":"2013-04-20T02:51:42Z","timestamp":1366426302000},"page":"201-226","source":"Crossref","is-referenced-by-count":164,"title":["Parallel stochastic gradient algorithms for large-scale matrix completion"],"prefix":"10.1007","volume":"5","author":[{"given":"Benjamin","family":"Recht","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christopher","family":"R\u00e9","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,4,21]]},"reference":[{"issue":"4","key":"53_CR1","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1137\/S0097539704441629","volume":"35","author":"N Alon","year":"2006","unstructured":"Alon, N., Naor, A.: Approximating the cut-norm via Grothendieck\u2019s inequality. SIAM J. Comput. 35(4), 787\u2013803 (2006)","journal-title":"SIAM J. Comput."},{"key":"53_CR2","unstructured":"Bach, F.R., Marial, J., Ponce, J.: Convex sparse matrix factorizations (2008). Preprint available at http:\/\/arxiv.org\/abs\/0812.1869"},{"key":"53_CR3","doi-asserted-by":"crossref","unstructured":"Balzano, L., Nowak, R., Recht, B.: Online identification and tracking of subspaces from highly incomplete information. In: Proceedings of the 48th Annual Allerton Conference (2010)","DOI":"10.1109\/ALLERTON.2010.5706976"},{"key":"53_CR4","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1137\/S1052623495287022","volume":"7","author":"DP Bertsekas","year":"1997","unstructured":"Bertsekas, D.P.: A hybrid incremental gradient method for least squares. SIAM J. Optim. 7, 913\u2013925 (1997)","journal-title":"SIAM J. Optim."},{"key":"53_CR5","volume-title":"Nonlinear Program.","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Program., 2nd edn. Athena Scientific, Belmont (1999)","edition":"2"},{"key":"53_CR6","unstructured":"Bottou, L., Bousquet, O.: The tradeoffs of large scale learning. Neural Information Processing Systems (2008)"},{"issue":"3","key":"53_CR7","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/s10107-004-0564-1","volume":"103","author":"S Burer","year":"2005","unstructured":"Burer, S., Monteiro, R.D.C.: Local minima and convergence in low-rank semidefinite programming. Math. Program. 103(3), 427\u2013444 (2005)","journal-title":"Math. Program."},{"issue":"4","key":"53_CR8","first-page":"1956","volume":"20","author":"JF Cai","year":"2008","unstructured":"Cai, J.F., Cand\u00e8s, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20(4), 1956\u20131982 (2008)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"53_CR9","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"E Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9(6), 717\u2013772 (2009)","journal-title":"Found. Comput. Math."},{"issue":"5","key":"53_CR10","doi-asserted-by":"crossref","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Tao, T.: The power of convex relaxation: Near-optimal matrix completion. IEEE Trans. Inf. Theory 56(5), 2053\u20132080 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"53_CR11","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"PL Combettes","year":"2005","unstructured":"Combettes, P.L., Wajs, V.R.: Signal recovery by proximal forward-backward splitting. Multiscale Model. Sim. 4(4), 1168\u20131200 (2005)","journal-title":"Multiscale Model. Sim."},{"key":"53_CR12","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Mathe. Program. Ser. A 91, 201\u2013213 (2002)","journal-title":"Mathe. Program. Ser. A"},{"key":"53_CR13","unstructured":"Drineas, P., Frieze, A., Kannan, R., Vempala, S., Vinay, V.: Clustering in large graphs and matrices. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (1999)"},{"key":"53_CR14","unstructured":"Funk, S.: Netflix update: Try this at home (2006). http:\/\/sifter.org\/simon\/journal\/20061211.html"},{"key":"53_CR15","doi-asserted-by":"crossref","first-page":"1548","DOI":"10.1109\/TIT.2011.2104999","volume":"57","author":"D Gross","year":"2011","unstructured":"Gross, D.: Recovering low-rank matrices from few coefficients in any basis. IEEE Trans. Inf. Theory 57, 1548\u20131566 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"53_CR16","doi-asserted-by":"crossref","unstructured":"Jameson, G.J.O.: Summing and Nuclear Norms in Banach Space Theory. No. 8 in London Mathematical Society Student Texts. Cambridge University Press, Cambridge, UK (1987)","DOI":"10.1017\/CBO9780511569166"},{"key":"53_CR17","doi-asserted-by":"crossref","unstructured":"Ji, S., Ye, J.: An accelerated gradient method for trace norm minimization. Proceedings of the ICML (2009)","DOI":"10.1145\/1553374.1553434"},{"issue":"6","key":"53_CR18","doi-asserted-by":"crossref","first-page":"2980","DOI":"10.1109\/TIT.2010.2046205","volume":"56","author":"RH Keshavan","year":"2009","unstructured":"Keshavan, R.H., Montanari, A., Oh, S.: Matrix completion from a few entries. IEEE Trans. Inf. Theory 56(6), 2980\u20132998 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"53_CR19","volume-title":"The Art of Computer Programming","author":"DE Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art of Computer Programming, 2nd edn. Addison-Wesley Professional, Boston (1998)","edition":"2"},{"issue":"3","key":"53_CR20","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Rev. 51(3), 455\u2013500 (2009)","journal-title":"SIAM Rev."},{"issue":"8","key":"53_CR21","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/MC.2009.263","volume":"42","author":"Y Koren","year":"2009","unstructured":"Koren, Y., Bell, R., Volinsky, C.: Matrix factorization techniques for recommender systems. Computer 42(8), 30\u201337 (2009)","journal-title":"Computer"},{"key":"53_CR22","unstructured":"Lee, J., Recht, B., Srebro, N., Salakhutdinov, R.R., Tropp, J.A.: Practical large-scale optimization for max-norm regularization. In: Advances in Neural Information Processing Systems (2010)"},{"issue":"3","key":"53_CR23","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(3), 1235\u20131256 (2009)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"53_CR24","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1162\/neco.1991.3.2.226","volume":"3","author":"ZQ Luo","year":"1991","unstructured":"Luo, Z.Q.: On the convergence of the LMS algorithm with adaptive learning rate for linear feedforward networks. Neural Comput. 3(2), 226\u2013245 (1991)","journal-title":"Neural Comput."},{"key":"53_CR25","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1080\/10556789408805580","volume":"4","author":"ZQ Luo","year":"1994","unstructured":"Luo, Z.Q., Tseng, P.: Analysis of an approximate gradient projection method with applications to the backpropagation algorithm. Optim. Methods Softw. 4, 85\u2013101 (1994)","journal-title":"Optim. Methods Softw."},{"key":"53_CR26","doi-asserted-by":"crossref","unstructured":"Ma, S., Goldfarb, D., Chen, L.: Fixed point and Bregman iterative methods for matrix rank minimization. Mathematical Programming pp. 1\u201333 (2009). Published online first at http:\/\/dx.doi.org\/10.1007\/s10107-009-0306-5","DOI":"10.1007\/s10107-009-0306-5"},{"key":"53_CR27","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1080\/10556789408805581","volume":"4","author":"OL Mangasarian","year":"1994","unstructured":"Mangasarian, O.L., Solodov, M.V.: Serial and parallel backpropagation convergence via nonmonotone perturbed minimization. Optim. Methods Softw. 4, 103\u2013116 (1994)","journal-title":"Optim. Methods Softw."},{"key":"53_CR28","doi-asserted-by":"crossref","unstructured":"Nedic A., Bertsekas, D.P.: Convergence rate of incremental subgradient algorithms. In: Uryasev, S., Pardalos, P.M. (eds) Stochastic Optimization: Algorithms and Applications, Kluwer Academic Publishers, pp. 263\u2013304 (2000)","DOI":"10.1007\/978-1-4757-6594-6_11"},{"issue":"4","key":"53_CR29","doi-asserted-by":"crossref","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A Nemirovski","year":"2009","unstructured":"Nemirovski, A., Juditsky, A., Lan, G., Shapiro, A.: Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19(4), 1574\u20131609 (2009)","journal-title":"SIAM J. Optim."},{"key":"53_CR30","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Tech. rep., CORE Discussion Paper (2007). Preprint available at http:\/\/www.optimization-online.org\/DB_HTML\/2007\/09\/1784.html"},{"key":"53_CR31","first-page":"3413","volume":"12","author":"B Recht","year":"2011","unstructured":"Recht, B.: A simpler approach to matrix completion. J. Mach. Learn. Res. 12, 3413\u20133430 (2011)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"53_CR32","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.: Guaranteed minimum rank solutions of matrix equations via nuclear norm minimization. SIAM Rev. 52(3), 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"key":"53_CR33","doi-asserted-by":"crossref","unstructured":"Rennie, J.D.M., Srebro, N.: Fast maximum margin matrix factorization for collaborative prediction. Proceedings of the International Conference of Machine Learning (2005)","DOI":"10.1145\/1102351.1102441"},{"issue":"5","key":"53_CR34","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14(5), 877\u2013898 (1976)","journal-title":"SIAM J. Control Optim."},{"key":"53_CR35","unstructured":"Salakhutdinov, R., Mnih, A.: Probabilistic matrix factorization. In: Advances in Neural Information Processing Systems (2008)"},{"key":"53_CR36","unstructured":"Srebro, N., Rennie, J., Jaakkola, T.: Maximum margin matrix factorization. In: Advances in Neural Information Processing Systems (2004)"},{"key":"53_CR37","doi-asserted-by":"crossref","unstructured":"Srebro, N., Shraibman, A.: Rank, trace-norm and max-norm. In: 18th Annual Conference on Learning Theory (COLT) (2005)","DOI":"10.1007\/11503415_37"},{"issue":"1","key":"53_CR38","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1093\/bioinformatics\/18.suppl_1.S136","volume":"18","author":"A Tanay","year":"2002","unstructured":"Tanay, A., Sharan, R., Shamir, R.: Discovering statistically significant biclusters in gene expression data. Bioinformatics 18(1), 136\u2013144 (2002)","journal-title":"Bioinformatics"},{"key":"53_CR39","first-page":"615","volume":"6","author":"KC Toh","year":"2010","unstructured":"Toh, K.C., Yun, S.: An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems. Pacific J. Math. 6, 615\u2013640 (2010)","journal-title":"Pacific J. Math."},{"issue":"2","key":"53_CR40","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1137\/S1052623495294797","volume":"8","author":"P Tseng","year":"1998","unstructured":"Tseng, P.: An incremental gradient(-projection) method with momentum term and adaptive stepsize rule. SIAM J. Optim. 8(2), 506\u2013531 (1998)","journal-title":"SIAM J. Optim."},{"key":"53_CR41","unstructured":"Wen, Z., Yin, W., Zhang, Y.: Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm. Tech. rep., Rice University, CAAM Technical, Report TR10-07 (2010)"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-013-0053-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-013-0053-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-013-0053-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T17:38:24Z","timestamp":1562953104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-013-0053-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,21]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["53"],"URL":"https:\/\/doi.org\/10.1007\/s12532-013-0053-8","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,21]]}}}