{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T04:00:18Z","timestamp":1784779218600,"version":"3.55.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2013,11,12]],"date-time":"2013-11-12T00:00:00Z","timestamp":1384214400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Stat"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s00180-013-0464-z","type":"journal-article","created":{"date-parts":[[2013,11,11]],"date-time":"2013-11-11T11:30:02Z","timestamp":1384169402000},"page":"591-621","source":"Crossref","is-referenced-by-count":66,"title":["Fixed-rank matrix factorizations and Riemannian low-rank optimization"],"prefix":"10.1007","volume":"29","author":[{"given":"Bamdev","family":"Mishra","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gilles","family":"Meyer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Silv\u00e8re","family":"Bonnabel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rodolphe","family":"Sepulchre","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,11,12]]},"reference":[{"key":"464_CR1","first-page":"803","volume":"10","author":"J Abernethy","year":"2009","unstructured":"Abernethy J, Bach F, Evgeniou T, Vert JP (2009) A new approach to collaborative filtering: operator estimation with spectral regularization. J Mach Learn Res 10:803\u2013826","journal-title":"J Mach Learn Res"},{"key":"464_CR2","unstructured":"Absil PA, Amodei L, Meyer G (2012) Two Newton methods on the manifold of fixed-rank matrices endowed with Riemannian quotient geometries. Tech. Rep. UCL-INMA-2012.05, U.C.Louvain"},{"key":"464_CR3","doi-asserted-by":"crossref","DOI":"10.1515\/9781400830244","volume-title":"Optimization algorithms on matrix manifolds","author":"PA Absil","year":"2008","unstructured":"Absil PA, Mahony R, Sepulchre R (2008) Optimization algorithms on matrix manifolds. Princeton University Press, Princeton"},{"key":"464_CR4","doi-asserted-by":"crossref","unstructured":"Amit Y, Fink M, Srebro N, Ullman S (2007) Uncovering shared structures in multiclass classification. In: Ghahramani Z (ed) Proceedings of the 24th international conference on machine learning, pp 17\u201324","DOI":"10.1145\/1273496.1273499"},{"key":"464_CR5","unstructured":"Baker CG, Absil PA, Gallivan KA (2007) GenRTR: the Generic Riemannian Trust-region package. http:\/\/www.math.fsu.edu\/cbaker\/genrtr\/"},{"key":"464_CR6","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1145\/361573.361582","volume":"15","author":"RH Bartels","year":"1972","unstructured":"Bartels RH, Stewart GW (1972) Solution of the matrix equation $$\\text{ ax }+\\text{ xb }=\\text{ c }$$ ax + xb = c [f4] (algorithm 432). Commun ACM 15:820\u2013826","journal-title":"Commun ACM"},{"key":"464_CR7","volume-title":"Positive definite matrices","author":"R Bhatia","year":"2007","unstructured":"Bhatia R (2007) Positive definite matrices. Princeton University Press, Princeton"},{"key":"464_CR8","doi-asserted-by":"crossref","first-page":"2397","DOI":"10.1093\/bioinformatics\/btp433","volume":"25","author":"K Bleakley","year":"2009","unstructured":"Bleakley K, Yamanishi Y (2009) Supervised prediction of drug-target interactions using bipartite local models. Bioinformatics 25:2397\u20132403","journal-title":"Bioinformatics"},{"key":"464_CR9","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.1137\/080731347","volume":"31","author":"S Bonnabel","year":"2009","unstructured":"Bonnabel S, Sepulchre R (2009) Riemannian metric and geometric mean for positive semidefinite matrices of fixed rank. SIAM J Matrix Anal Appl 31:1055\u20131070","journal-title":"SIAM J Matrix Anal Appl"},{"key":"464_CR10","unstructured":"Boumal N, Absil PA (2011) RTRMC: A Riemannian trust-region method for low-rank matrix completion. In: Shawe-Taylor J, Zemel R, Bartlett P, Pereira F, Weinberger K (eds) Neural information processing systems conference, NIPS, pp 406\u2013414"},{"key":"464_CR11","unstructured":"Boumal N, Absil PA (2012), Low-rank matrix completion via trust-regions on the Grassmann manifold. Tech. rep., UCL-INMA-2012.07"},{"key":"464_CR12","unstructured":"Boumal N, Mishra B, Absil PA, Sepulchre R (2013), Manopt: a Matlab toolbox for optimization on manifolds. arXiv, preprint arXiv:13085200 [csMS]"},{"key":"464_CR13","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.laa.2005.07.021","volume":"415","author":"M Brand","year":"2006","unstructured":"Brand M (2006) Fast low-rank modifications of the thin singular value decomposition. Linear Algebra Appl 415:20\u201330","journal-title":"Linear Algebra Appl"},{"key":"464_CR14","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"JF Cai","year":"2010","unstructured":"Cai JF, Cand\u00e8s EJ, Shen Z (2010) A singular value thresholding algorithm for matrix completion. SIAM J Optim 20:1956\u20131982","journal-title":"SIAM J Optim"},{"key":"464_CR15","doi-asserted-by":"crossref","unstructured":"Cai D, He X, Han J (2007) Efficient kernel discriminant analysis via spectral regression. In: Proceedings of the IEEE international conference on data mining, ICDM, pp 427\u2013432","DOI":"10.1109\/ICDM.2007.88"},{"key":"464_CR16","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 EJ, Recht B (2008) Exact matrix completion via convex optimization. Found Comput Math 9:717\u2013772","journal-title":"Found Comput Math"},{"key":"464_CR17","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 (2011) Subspace evolution and transfer (SET) for low-rank matrix completion. IEEE Trans Signal Process 59:3120\u20133132","journal-title":"IEEE Trans Signal Process"},{"key":"464_CR18","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 (2012) A geometric approach to low-rank matrix completion. IEEE Trans Inf Theory 58:237\u2013247","journal-title":"IEEE Trans Inf Theory"},{"key":"464_CR19","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/S0895479895290954","volume":"20","author":"A Edelman","year":"1998","unstructured":"Edelman A, Arias T, Smith S (1998) The geometry of algorithms with orthogonality constraints. SIAM J Matrix Anal Appl 20:303\u2013353","journal-title":"SIAM J Matrix Anal Appl"},{"key":"464_CR20","first-page":"615","volume":"6","author":"T Evgeniou","year":"2005","unstructured":"Evgeniou T, Micchelli C, Pontil M (2005) Learning multiple tasks with kernel methods. J Mach Learn Res 6:615\u2013637","journal-title":"J Mach Learn Res"},{"key":"464_CR21","unstructured":"Golub GH, Van Loan CF (1996) Matrix computations, 3rd edn. The Johns Hopkins University Press, 2715 North Charles Street, Baltimore, Maryland 21218\u20134319"},{"key":"464_CR22","doi-asserted-by":"crossref","first-page":"1548","DOI":"10.1109\/TIT.2011.2104999","volume":"57","author":"D Gross","year":"2011","unstructured":"Gross D (2011) Recovering low-rank matrices from few coefficients in any basis. IEEE Trans Inf Theory 57:1548\u20131566","journal-title":"IEEE Trans Inf Theory"},{"key":"464_CR23","unstructured":"Jain P, Meka R, Dhillon I (2010) Guaranteed rank minimization via singular value projection. In: Lafferty J, Williams CKI, Shawe-Taylor J, Zemel R, Culotta A (eds) Advances in neural information processing systems. NIPS 23, pp 937\u2013945"},{"key":"464_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1838599.1838602","volume":"44","author":"DJ Jeffrey","year":"2010","unstructured":"Jeffrey DJ (2010) LU factoring of non-invertible matrices. ACM Commun Comput Algebra 44:1\u20138","journal-title":"ACM Commun Comput Algebra"},{"key":"464_CR25","unstructured":"Journ\u00e9e M (2009) Geometric algorithms for component analysis with a view to gene expression data analysis. PhD thesis, University of Li\u00e8ge, Li\u00e8ge, Belgium"},{"key":"464_CR26","first-page":"2057","volume":"11","author":"RH Keshavan","year":"2010","unstructured":"Keshavan RH, Montanari A, Oh S (2010) Matrix completion from noisy entries. J Mach Learn Res 11:2057\u20132078","journal-title":"J Mach Learn Res"},{"key":"464_CR27","first-page":"341","volume":"10","author":"B Kulis","year":"2009","unstructured":"Kulis B, Sustik M, Dhillon IS (2009) Low-rank kernel learning with Bregman matrix divergences. J Mach Learn Res 10:341\u2013376","journal-title":"J Mach Learn Res"},{"key":"464_CR28","doi-asserted-by":"crossref","unstructured":"Kulis B, Saenko K, Darrell T (2011) What you saw is not what you get: Domain adaptation using asymmetric kernel transforms. In: Proceedings of the IEEE conference on computer vision and pattern recognition, CVPR, pp 1785\u20131792","DOI":"10.1109\/CVPR.2011.5995702"},{"key":"464_CR29","doi-asserted-by":"crossref","unstructured":"Larsen R (1998) Lanczos bidiagonalization with partial reorthogonalization. Technical Report DAIMI PB-357, Department of Computer Science, Aarhus University","DOI":"10.7146\/dpb.v27i537.7070"},{"key":"464_CR30","volume-title":"Introduction to smooth manifolds, graduate texts in mathematics","author":"JM Lee","year":"2003","unstructured":"Lee JM (2003) Introduction to smooth manifolds, graduate texts in mathematics, vol 218, 2nd edn. Springer, New York","edition":"2"},{"key":"464_CR31","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 (2010) Admira: atomic decomposition for minimum rank approximation. IEEE Trans Inf Theory 56:4402\u20134416","journal-title":"IEEE Trans Inf Theory"},{"key":"464_CR32","first-page":"2287","volume":"11","author":"R Mazumder","year":"2010","unstructured":"Mazumder R, Hastie T, Tibshirani R (2010) Spectral regularization algorithms for learning large incomplete matrices. J Mach Learn Res 11:2287\u20132322","journal-title":"J Mach Learn Res"},{"key":"464_CR33","unstructured":"Meka R, Jain P, Dhillon IS (2009) Matrix completion from power-law distributed samples. In: Bengio Y, Schuurmans D, Lafferty J, Williams CKI, Culotta A (eds) Advances in neural information processing systems 22, NIPS, pp 1258\u20131266"},{"key":"464_CR34","unstructured":"Meyer G (2011) Geometric optimization algorithms for linear regression on fixed-rank matrices. PhD thesis, University of Li\u00e8ge, Li\u00e8ge, Belgium"},{"key":"464_CR35","unstructured":"Meyer G, Bonnabel S, Sepulchre R (2011b) Regression on fixed-rank positive semidefinite matrices: a Riemannian approach. J Mach Learn Res 11:593\u2013625"},{"key":"464_CR36","unstructured":"Meyer G, Bonnabel S, Sepulchre R (2011a) Linear regression under fixed-rank constraints: a Riemannian approach. In: Proceedings of the 28th international conference on machine learning, ICML, pp 545\u2013552"},{"key":"464_CR37","unstructured":"Mishra B, Adithya Apuroop K, Sepulchre R (2012) A Riemannian geometry for low-rank matrix completion. Tech. rep., arXiv:1211.1550"},{"key":"464_CR38","unstructured":"Mishra B, Meyer G, Bach F, Sepulchre R (2011a) Low-rank optimization with trace norm penalty. Tech. rep., arXiv:1112.2318"},{"key":"464_CR39","doi-asserted-by":"crossref","unstructured":"Mishra B, Meyer G, Sepulchre R (2011b) Low-rank optimization for distance matrix completion. In: Proceedings of the 50th IEEE conference on decision and control, Orlando (USA), pp 4455\u20134460","DOI":"10.1109\/CDC.2011.6160810"},{"key":"464_CR40","unstructured":"Netflix (2006) The Netflix prize. http:\/\/www.netflixprize.com\/"},{"key":"464_CR41","unstructured":"Ngo TT, Saad Y (2012) Scaled gradients on Grassmann manifolds for matrix completion. In: Advances in neural information processing systems, NIPS, pp 1421\u20131429"},{"key":"464_CR42","volume-title":"Numerical optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal J, Wright SJ (2006) Numerical optimization, 2nd edn. Springer, New York","edition":"2"},{"key":"464_CR43","doi-asserted-by":"crossref","first-page":"193","DOI":"10.2307\/2690882","volume":"72","author":"R Piziak","year":"1999","unstructured":"Piziak R, Odell PL (1999) Full rank factorization of matrices. Math Mag 72:193\u2013201","journal-title":"Math Mag"},{"key":"464_CR44","doi-asserted-by":"crossref","unstructured":"Rennie J, Srebro N (2005), Fast maximum margin matrix factorization for collaborative prediction. In: Proceedings of the 22nd international conference on machine learning, pp 713\u2013719","DOI":"10.1145\/1102351.1102441"},{"key":"464_CR45","unstructured":"Shalit U, Weinshall D, Chechik G (2010) Online learning in the manifold of low-rank matrices. In: Lafferty J, Williams CKI, Shawe-Taylor J, Zemel R, Culotta A (eds) Advances in neural information processing systems 23, pp 2128\u20132136"},{"key":"464_CR46","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s10543-010-0253-9","volume":"50","author":"L Simonsson","year":"2010","unstructured":"Simonsson L, Eld\u00e9n L (2010) Grassmann algorithms for low rank approximation of matrices with missing values. BIT Numer Math 50:173\u2013191","journal-title":"BIT Numer Math"},{"key":"464_CR47","doi-asserted-by":"crossref","first-page":"1214","DOI":"10.1137\/110845768","volume":"23","author":"B Vandereycken","year":"2013","unstructured":"Vandereycken B (2013) Low-rank matrix completion by Riemannian optimization. SIAM J Optim 23:1214\u20131236","journal-title":"SIAM J Optim"},{"key":"464_CR48","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s12532-012-0044-1","volume":"4","author":"Z Wen","year":"2012","unstructured":"Wen Z, Yin W, Zhang Y (2012) Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm. Math Program Comput 4:333\u2013361","journal-title":"Math Program Comput"},{"key":"464_CR49","doi-asserted-by":"crossref","first-page":"i232","DOI":"10.1093\/bioinformatics\/btn162","volume":"24","author":"Y Yamanishi","year":"2008","unstructured":"Yamanishi Y, Araki M, Gutteridge A, Honda W, Kanehisa M (2008) Prediction of drug-target interaction networks from the integration of chemical and genomic spaces. Bioinformatics 24:i232","journal-title":"Bioinformatics"},{"key":"464_CR50","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1111\/j.1467-9868.2007.00591.x","volume":"69","author":"M Yuan","year":"2007","unstructured":"Yuan M, Ekici A, Lu Z, Monteiro R (2007) Dimension reduction and coefficient estimation in multivariate linear regression. J R Stat Soc 69:329\u2013346","journal-title":"J R Stat Soc"}],"container-title":["Computational Statistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00180-013-0464-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00180-013-0464-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00180-013-0464-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,7]],"date-time":"2020-08-07T18:08:34Z","timestamp":1596823714000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00180-013-0464-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,12]]},"references-count":50,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["464"],"URL":"https:\/\/doi.org\/10.1007\/s00180-013-0464-z","relation":{},"ISSN":["0943-4062","1613-9658"],"issn-type":[{"value":"0943-4062","type":"print"},{"value":"1613-9658","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,12]]}}}