Global Optimality of Local Search for Low Rank Matrix Recovery

A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization

S. Burer and R. D. Monteiro · 2003

Earlier work this paper cites.

Weighted low-rank approximations

N. Srebro and T. Jaakkola · 2003

Earlier work this paper cites.

Local minima and convergence in low-rank semidefinite programming

S. Burer and R. D. Monteiro · 2005

Earlier work this paper cites.

Fast maximum margin matrix factorization for collaborative prediction

J. D. Rennie and N. Srebro · 2005

Earlier work this paper cites.

Cubic regularization of newton method and its global performance

Y. Nesterov and B. T. Polyak · 2006

Earlier work this paper cites.

The restricted isometry property and its implications for compressed sensing

E. J. Candès · 2008

Earlier work this paper cites.

Quantum state tomography via compressed sensing

D. Gross, Y.-K. Liu, S. T. Flammia, S. Becker, and J. Eisert · 2010

Earlier work this paper cites.

Guaranteed rank minimization via singular value projection

P. Jain, R. Meka, and I. S. Dhillon · 2010

Earlier work this paper cites.

Low-rank optimization on the cone of positive semidefinite matrices

M. Journée, F. Bach, P.-A. Absil, and R. Sepulchre · 2010

Earlier work this paper cites.

Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization

B. Recht, M. Fazel, and P. A. Parrilo · 2010

Earlier work this paper cites.

Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements

E. J. Candes and Y. Plan · 2011

Cited alongside, same era.

Complexity bounds for second-order optimality in unconstrained optimization

C. Cartis, N. I. Gould, and P. L. Toint · 2012

Cited alongside, same era.

Quantum tomography via compressed sensing: Error bounds, sample complexity and efficient estimators

S. Flammia, D. Gross, Y.-K. Liu, and J. Eisert · 2012

Cited alongside, same era.

Efficient algorithms for collaborative filtering

R. H. Keshavan · 2012

Cited alongside, same era.

Low-rank matrix completion using alternating minimization

P. Jain, P. Netrapalli, and S. Sanghavi · 2013

Cited alongside, same era.

Computational limits for matrix completion

M. Hardt, R. Meka, P. Raghavendra, and B. Weitz · 2014

Global convergence of stochastic gradient descent for some non-convex matrix problems

C. D. Sa, C. Re, and K. Olukotun · 2015

Later among the works it cites.

Complete dictionary recovery using nonconvex optimization

J. Sun, Q. Qu, and J. Wright · 2015

Later among the works it cites.

Low-rank solutions of linear matrix equations via Procrustes flow

Original

S. Tu, R. Boczar, M. Soltanolkotabi, and B. Recht · 2015

Later among the works it cites.

Global convergence of a grassmannian gradient descent algorithm for subspace estimation

Original

D. Zhang and L. Balzano · 2015

Later among the works it cites.

A nonconvex optimization framework for low rank matrix estimation

T. Zhao, Z. Wang, and H. Liu · 2015

Later among the works it cites.