Low-rank Matrix Completion using Alternating Minimization

Nonlinear Programming: A Unified Approach

W. I. Zangwill · 1969

Earlier work this paper cites.

Matrix Computations

G. H. Golub and C. F. V. Loan · 1996

Earlier work this paper cites.

Decoding by linear programming

E. J. Candès and T. Tao · 2005

Earlier work this paper cites.

Sparse principal component analysis

Original

H. Zou, T. Hastie, and R. Tibshirani · 2006

Earlier work this paper cites.

Nonnegative matrix factorization based on alternating nonnegativity constrained least squares and active set method

H. Kim and H. Park · 2008

Earlier work this paper cites.

Sparse nonnegative matrix factorization for clustering

J. Kim and H. Park · 2008

Earlier work this paper cites.

Rank minimization via online learning

R. Meka, P. Jain, C. Caramanis, and I. S. Dhillon · 2008

Earlier work this paper cites.

Large-scale parallel collaborative filtering for the netflix prize

Y. Zhou, D. M. Wilkinson, R. Schreiber, and R. Pan · 2008

Earlier work this paper cites.

Exact matrix completion via convex optimization

E. J. Candès and B. Recht · 2009

Cited alongside, same era.

The power of convex relaxation: Near-optimal matrix completion

E. J. Candès and T. Tao · 2009

Cited alongside, same era.

The BellKor solution to the Netflix grand prize, 2009

Y. Koren · 2009

Cited alongside, same era.

Matrix factorization techniques for recommender systems

Y. Koren, R. M. Bell, and C. Volinsky · 2009

Cited alongside, same era.

A singular value thresholding algorithm for matrix completion

J.-F. Cai, E. J. Candès, and Z. Shen · 2010

Cited alongside, same era.

Guaranteed rank minimization via singular value projection

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

Cited alongside, same era.

Admira: atomic decomposition for minimum rank approximation

K. Lee and Y. Bresler · 2010

Later among the works it cites.

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

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

Later among the works it cites.

Robust principal component analysis?

E. J. Candès, X. Li, Y. Ma, and J. Wright · 2011

Later among the works it cites.

Rank-sparsity incoherence for matrix decomposition

V. Chandrasekaran, S. Sanghavi, P. A. Parrilo, and A. S. Willsky · 2011

Later among the works it cites.

Clustering partially observed graphs via convex optimization

A. Jalali, Y. Chen, S. Sanghavi, and H. Xu · 2011

Later among the works it cites.

Matrix completion via an alternating direction method

C. Chen, B. He, and X. Yuan · 2012

Closest in time.