Matrix Completion With Noise

Complexity of quantifier elimination in the theory of algebraically closed fields

A. L. Chistov and D. Yu. Grigoriev · 1984

Earlier work this paper cites.

Multiple emitter location and signal parameter estimation

R. O. Schmidt · 1986

Earlier work this paper cites.

Using collaborative filtering to weave an information tapestry

D. Goldberg, D. Nichols, B. M. Oki, and D. Terry · 1992

Earlier work this paper cites.

Shape and motion from image streams under orthography: a factorization method

C. Tomasi and T. Kanade · 1992

Earlier work this paper cites.

On the rank minimization problem over a positive semidefinite linear matrix inequality

M. Mesbahi and G. P. Papavassilopoulos · 1997

Earlier work this paper cites.

Computational study and comparisons of LFT reducibility methods

C. Beck and R. D’Andrea · 1998

Earlier work this paper cites.

Matrix Rank Minimization with Applications

M. Fazel · 2002

Earlier work this paper cites.

Sampling signals with finite rate of innovation

M. Vetterli, P. Marziliano, and T. Blu · 2002

Earlier work this paper cites.

Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices

M. Fazel, H. Hindi, and S. Boyd · 2003

Earlier work this paper cites.

Recovering the missing components in a large noisy low-rank matrix: application to SFM source

P. Chen and D. Suter · 2004

Earlier work this paper cites.

Decoding by linear programming

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

Cited alongside, same era.

Improved time bounds for near-optimal sparse Fourier representation

A. Gilbert, S. Muthukrishnan, and M. Strauss · 2005

Cited alongside, same era.

Semidefinite programming based algorithms for sensor network localization

P. Biswas, T-C. Lian, T-C. Wang, and Y. Ye · 2006

Cited alongside, same era.

Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

E. J. Candès, J. Romberg, and T. Tao · 2006

Cited alongside, same era.

For most large underdetermined systems of linear equations, the minimal L1-norm solution is also the sparsest solution

D. Donoho · 2006

Cited alongside, same era.

Counting faces of randomly-projected polytopes when the projection radically lowers dimension

A singular value thresholding algorithm for matrix completion

Original

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

Later among the works it cites.

Exact Matrix Completion via Convex Optimization

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

Later among the works it cites.

Compressed sensing and robust recovery of low rank matrices

M. Fazel, E. Candès, B. Recht, and P. Parrilo · 2008

Later among the works it cites.

Interior-point method for nuclear norm approximation with application to system identification

Z. Liu and L. Vandenberghe · 2008

Later among the works it cites.

Fixed point and Bregman iterative methods for matrix rank minimization

S. Ma, D. Goldfarb, and L. Chen · 2008

Later among the works it cites.

A remark on global positioning from local distances