Low-rank matrix completion via preconditioned optimization on the Grassmann manifold

[1]  R. Kannan,et al.  Bounded matrix factorization for recommender system , 2014, Knowledge and Information Systems.

[2]  Bamdev Mishra,et al.  Riemannian Preconditioning , 2014, SIAM J. Optim..

[3]  Reinhold Schneider,et al.  Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality , 2014, SIAM J. Optim..

[4]  Nicolas Gillis,et al.  The Why and How of Nonnegative Matrix Factorization , 2014, ArXiv.

[5]  Moritz Hardt,et al.  Understanding Alternating Minimization for Matrix Completion , 2013, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[6]  P. Absil,et al.  Manopt, a matlab toolbox for optimization on manifolds , 2013, J. Mach. Learn. Res..

[7]  Christopher Ré,et al.  Parallel stochastic gradient algorithms for large-scale matrix completion , 2013, Mathematical Programming Computation.

[8]  Hiroyuki Sato,et al.  A new, globally convergent Riemannian conjugate gradient method , 2013, 1302.0125.

[9]  S. Chatterjee,et al.  Matrix estimation by Universal Singular Value Thresholding , 2012, 1212.1247.

[10]  Yousef Saad,et al.  Scaled Gradients on Grassmann Manifolds for Matrix Completion , 2012, NIPS.

[11]  Bamdev Mishra,et al.  A Riemannian geometry for low-rank matrix completion , 2012, ArXiv.

[12]  Bart Vandereycken.  Low-Rank Matrix Completion by Riemannian Optimization , 2012, SIAM J. Optim..

[13]  Gilles Meyer,et al.  Two Newton methods on the manifold of fixed-rank matrices endowed with Riemannian quotient geometries , 2012, Computational Statistics.

[14]  Yin Zhang,et al.  Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm , 2012, Mathematical Programming Computation.

[15]  Pierre-Antoine Absil,et al.  RTRMC: A Riemannian trust-region method for low-rank matrix completion , 2011, NIPS.

[16]  Bamdev Mishra,et al.  Low-Rank Optimization with Trace Norm Penalty , 2011, SIAM J. Optim..

[17]  Bamdev Mishra,et al.  Low-rank optimization for distance matrix completion , 2011, IEEE Conference on Decision and Control and European Control Conference.

[18]  Ameet Talwalkar,et al.  Divide-and-Conquer Matrix Factorization , 2011, NIPS.

[19]  Silvere Bonnabel,et al.  Linear Regression under Fixed-Rank Constraints: A Riemannian Approach , 2011, ICML.

[20]  Nicolas Gillis,et al.  Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard , 2010, SIAM J. Matrix Anal. Appl..

[21]  Robert D. Nowak,et al.  Online identification and tracking of subspaces from highly incomplete information , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[22]  Olgica Milenkovic,et al.  Subspace Evolution and Transfer (SET) for Low-Rank Matrix Completion , 2010, IEEE Transactions on Signal Processing.

[23]  Olgica Milenkovic,et al.  A Geometric Approach to Low-Rank Matrix Completion , 2010, IEEE Transactions on Information Theory.

[24]  Andrea Montanari,et al.  Regularization for matrix completion , 2010, 2010 IEEE International Symposium on Information Theory.

[25]  Andrea Montanari,et al.  Low-rank matrix completion with noisy observations: A quantitative comparison , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[26]  Pablo A. Parrilo,et al.  Rank-Sparsity Incoherence for Matrix Decomposition , 2009, SIAM J. Optim..

[27]  Andrea Montanari,et al.  Matrix Completion from Noisy Entries , 2009, J. Mach. Learn. Res..

[28]  Yoram Bresler,et al.  ADMiRA: Atomic Decomposition for Minimum Rank Approximation , 2009, IEEE Transactions on Information Theory.

[29]  Emmanuel J. Candès,et al.  A Singular Value Thresholding Algorithm for Matrix Completion , 2008, SIAM J. Optim..

[30]  Emmanuel J. Candès,et al.  Exact Matrix Completion via Convex Optimization , 2008, Found. Comput. Math..

[31]  Robert E. Mahony,et al.  Optimization Algorithms on Matrix Manifolds , 2007 .

[32]  Pierre-Antoine Absil,et al.  Trust-Region Methods on Riemannian Manifolds , 2007, Found. Comput. Math..

[33]  Jorge Nocedal,et al.  Global Convergence Properties of Conjugate Gradient Methods for Optimization , 1992, SIAM J. Optim..

[34]  K. Leichtweiss.  Zur Riemannschen Geometrie in Grassmannschen Mannigfaltigkeiten , 1961 .

[35]  D. Gleich.  TRUST REGION METHODS , 2017 .

[36]  Nicolas Boumal,et al.  Optimization and estimation on manifolds , 2014 .

[37]  Xiaoming Yuan,et al.  Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations , 2011, SIAM J. Optim..

[38]  S. Yun,et al.  An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems , 2009 .

[39]  James Bennett,et al.  The Netflix Prize , 2007 .

[40]  W. Hager,et al.  A SURVEY OF NONLINEAR CONJUGATE GRADIENT METHODS , 2005 .

[41]  L. Trefethen,et al.  Numerical linear algebra , 1997 .

[42]  W. Boothby.  An introduction to differentiable manifolds and Riemannian geometry , 1975 .