Recovering low-rank matrices from few coefficients in any basis

Yurinskii, “Exponential bounds for large deviations,” Theory Probab. Appl. , vol. 19, p. 154, 1974

1974

Earlier work this paper cites.

M. Isaacs, Character theory of finite groups . New York: Academic Press, 1976

Original

1976

Earlier work this paper cites.

A. W. Marshall and I. Olkin, Inequalities . Academic Press, 1979

1979

Earlier work this paper cites.

M. Ledoux and M. Talagrand, Probability in Banach spaces . Springer, 1991

1991

Earlier work this paper cites.

Petz, “A survey of certain trace inequalities,” Functional Analysis and Operator Theory , vol. 30, p. 287, 1994

1994

Earlier work this paper cites.

B. K. Natarajan, “Sparse approximate solutions to linear systems,” SIAM J. Comput. , vol. 24, no. 2, pp. 227–234, 1995

1995

Earlier work this paper cites.

R. Bhatia, Matrix analysis . New-York: Springer, 1997

1997

Earlier work this paper cites.

D. Gottesman, “Stabilizer codes and quantum error correction,” Ph.D. dissertation, Caltech, 1997. [Online]. Available: http://arxiv.org/abs/quant-ph/9705052

1997

Earlier work this paper cites.

M. Mesbahi and G. Papavassilopoulos, “On the rank minimization problem over a positive semidefinite linear matrix inequality,” Automatic Control, IEEE Transactions on , vol. 42, no. 2, pp. 239–243, 1997

1997

Earlier work this paper cites.

McDiarmid, “Concentration,” Probabilistic methods for algorithmic discrete mathematics , vol. 16, pp. 195–248, 1998

1998

Earlier work this paper cites.

M. Rudelson, “Random vectors in the isotropic position,” Journal of Functional Analysis , vol. 164, no. 1, pp. 60–72, 1999

1999

Earlier work this paper cites.

M. A. Nielsen and I. L. Chuang, Quantum computation and quantum information . Cambridge University Press, 2000

2000

Earlier work this paper cites.

R. F. Werner, “All teleportation and dense coding schemes,” Journal of Physics A: Mathematical and General , vol. 34, no. 35, pp. 7081–7094, 2001

2001

Earlier work this paper cites.

M. Fazel, H. Hindi, and S. Boyd, “A rank minimization heuristic with application to minimum order system approximation,” in American Control Conference, 2001. Proceedings of the 2001 , vol. 6, 2001, pp. 4734–4739 vol.6

2001

Cited alongside, same era.

R. Ahlswede and A. Winter, “Strong converse for identification via quantum channels,” IEEE Transactions on Information Theory , vol. 48, no. 3, pp. 569–579, 2002

2002

Cited alongside, same era.

D. P. Bertsekas, A. Nedić, and A. E. Ozdaglar, Convex analysis and optimization . Athena Scientific, 2003

2003

Cited alongside, same era.

D. Donoho, “Compressed sensing,” IEEE Transactions on Information Theory , vol. 52, no. 4, pp. 1289–1306, 2006

2006

Cited alongside, same era.

E. Candes, J. Romberg, and T. Tao, “Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information,” IEEE Transactions on Information Theory , vol. 52, no. 2, pp. 489–509, 2006

E. J. Candes and T. Tao, “The power of convex relaxation: Near-Optimal matrix completion,” preprint , Mar. 2009. [Online]. Available: http://arxiv.org/abs/0903.1476

Original

2009

Closest in time.

E. J. Candes and Y. Plan, “Matrix completion with noise,” Proceedings of the IEEE , 2009

2009

Closest in time.

A. Singer and M. Cucuringu, “Uniqueness of Low-Rank matrix completion by rigidity theory,” preprint , Feb. 2009. [Online]. Available: http://arxiv.org/abs/0902.3846

Original

2009

Closest in time.

R. H. Keshavan, A. Montanari, and S. Oh, “Matrix completion from a few entries,” preprint , Jan. 2009. [Online]. Available: http://arxiv.org/abs/0901.3150

Original

2009

Closest in time.

J. Wright, A. Ganesh, S. Rao, and Y. Ma, “Robust principal component analysis: Exact recovery of corrupted Low-Rank matrices,” preprint , May 2009. [Online]. Available: http://arxiv.org/abs/0905.0233