Matrix Completion from a Few Entries

L. Armijo, Minimization of functions having lipschitz continuous first partial derivatives , Pacific J. Math. 16

1966

Earlier work this paper cites.

J. Friedman, J. Kahn, and E. Szemerédi, On the second eigenvalue in random regular graphs , Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing (Seattle, Washington, USA), ACM, may 1989, pp. 587–598

1989

Earlier work this paper cites.

M. W. Berry, Large scale sparse singular value computations , International Journal of Supercomputer Applications 6

1992

Earlier work this paper cites.

M. W. Berry, Z. Drmać, and E. R. Jessup, Matrices, vector spaces, and information retrieval , SIAM Review 41

1999

Earlier work this paper cites.

A. Edelman, T. A. Arias, and S. T. Smith, The geometry of algorithms with orthogonality constraints , SIAM J. Matr. Anal. Appl. 20

1999

Earlier work this paper cites.

Y. Azar, A. Fiat, A. Karlin, F. McSherry, and J. Saia, Spectral analysis of data , Proceedings of the thirty-third annual ACM symposium on Theory of computing (New York, NY, USA), ACM, 2001, pp. 619–626

2001

Earlier work this paper cites.

M. Fazel, Matrix rank minimization with applications , Ph.D. thesis, Stanford University, 2002

2002

Earlier work this paper cites.

A. Frieze, R. Kannan, and S. Vempala, Fast monte-carlo algorithms for finding low-rank approximations , J. ACM 51

2004

Cited alongside, same era.

U. Feige and E. Ofek, Spectral techniques applied to sparse random graphs , Random Struct. Algorithms 27

2005

Cited alongside, same era.

E. J. Candes, J. K. Romberg, and T. Tao, Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , IEEE Trans. on Inform. Theory 52

2006

Cited alongside, same era.

D. L. Donoho, Compressed Sensing , IEEE Trans. on Inform. Theory 52

2006

Cited alongside, same era.

D. Achlioptas and F. McSherry, Fast computation of low-rank matrix approximations , J. ACM 54

2007

Cited alongside, same era.

J-F Cai, E. J. Candès, and Z. Shen, A singular value thresholding algorithm for matrix completion , arXiv:0810.3286

Original

2008

Later among the works it cites.

E. J. Candès and B. Recht, Exact matrix completion via convex optimization , arxiv:0805.4471

Original

2008

Later among the works it cites.

R. H. Keshavan, A. Montanari, and S. Oh, Learning low rank matrices from O ⁡ ( n ) O(n) entries , Proc. of the Allerton Conf. on Commun., Control and Computing, September 2008

2008

Later among the works it cites.

E. J. Candès and T. Tao, The power of convex relaxation: Near-optimal matrix completion , arXiv:0903.1476

Original

2009

Closest in time.

R. H. Keshavan, S. Oh, and A. Montanari, Matrix completion from a few entries , arXiv:0901.3150, January 2009