The power of convex relaxation: Near-optimal matrix completion

IEEE Transactions on Information Theory

Volumn 56, Issue 5, 2010, Pages 2053-2080

  Candès, Emmanuel J ^a   Tao, Terence ^b  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Duality in optimization; Free probability; Low rank matrices; Matrix completion; Nuclear norm minimization; Random matrices and techniques from random matrix theory; Semidefinite programming

Indexed keywords

DUALITY IN OPTIMIZATION; LOW-RANK MATRICES; MATRIX COMPLETION; RANDOM MATRICES; RANDOM MATRIX THEORY; SEMI-DEFINITE PROGRAMMING;

INFORMATION THEORY; MATHEMATICAL PROGRAMMING; RELAXATION PROCESSES;

MATRIX ALGEBRA;

EID: 77951528523     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2010.2044061     Document Type: Article

References (27)

1. J. Abernethy, F. Bach, T. Evgeniou, and J.-P. Vert, Low-Rank Matrix Factorization With Attributes, Ecole des Mines de Paris, 2006, Tech. Rep. N24/06/MM.
2. Y. Amit, M. Fink, N. Srebro, and S. Ullman, "Uncovering shared structures in multiclass classification, " presented at the 24h Int. Conf. Machine Learning, 2007.
3. A. Argyriou, T. Evgeniou, and M. Pontil, "Multi-task feature learning, " Neural Inf. Process. Syst., 2007.
4. A. Barvinok, "A course in convexity, " in Graduate Studies in Mathematics. Providence, RI: AMS, 2002, vol. 54.
5. P. Biswas, T.-C. Lian, T.-C. Wang, and Y. Ye, "Semidefinite programming based algorithms for sensor network localization, " ACM Trans. Sens. Netw., vol. 2, no. 2, pp. 188-220, 2006.
6. J.-F. Cai, E. J. Candès, and Z. Shen, A Singular Value Thresholding Algorithm for Matrix Completion Tech. Rep., 2008 [Online]. Available: http://arxiv.org/abs/0810.3286
7. E. J. Candès and B. Recht, "Exact matrix completion via convex optimization, " Found. Comput. Math., 2008, to be published.
8. E. J. Candès, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information, " IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 489-509, Feb. 2006.
9. P. Chen and D. Suter, "Recovering the missing components in a large noisy low-rank matrix: Application to SFM source, " IEEE Trans. Pattern Anal. Mach. Intell, vol. 26, no. 8, pp. 1051-1063, Aug. 2004.
10. V. H. de la Peña and S. J. Montgomery-Smith, "Decoupling inequalities for the tail probabilities of multivariate U-statistics, " Ann. Prob., vol. 23, no. 2, pp. 806-816, 1995.
11. M. Fazel, H. Hindi, and S. Boyd, "Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices, " presented at the Amer. Control Conf., Jun. 2003.
12. D. Goldberg, D. Nichols, B. M. Oki, and D. Terry, "Using collaborative filtering to weave an information tapestry, " Commun. ACM, vol. 35, pp. 61-70, 1992.
13. R. Keshavan, A. Montanari, and S. Oh, Matrix Completion From a Few Entries Tech. Rep., 2009.
14. R. Keshavan, S. Oh, and A. Montanari, "Matrix completion from a few entries, " presented at the ISIT, 2009, arXiv:0901.3150.
15. M. Ledoux, The Concentration of Measure Phenomenon. Providence, RI: AMS, 2001.
16. A. S. Lewis, "The mathematics of eigenvalue optimization, " Math. Programm. B, vol. 97, no. 1-2, pp. 155-176, 2003.
17. p (1 < p < ∞), " ComptesRendus Acad. Sci. Paris, Série I, vol. 303, no. 7, pp. 289-292, 1986.
18. S. Ma, D. Goldfarb, and L. Chen, Fixed Point and Bregman Iterative Methods for Matrix Rank Minimization Tech. Rep., 2008.
19. C. McDiarmid, "Centering sequences with bounded differences, " Combin. Probab. Comput., vol. 6, no. 1, pp. 79-86, 1997.
20. M. Mesbahi and G. P. Papavassilopoulos, "On the rank minimization problem over a positive semidefinite linear matrix inequality, " IEEE Trans. Autom. Control, vol. 42, pp. 239-243, 1997.
21. B. Recht, M. Fazel, and P. Parrilo, "Guaranteed minimum rank solutions of matrix equations via nuclear norm minimization, " SIAM Rev., 2007, submitted for publication.
22. A. Singer, "A remark on global positioning from local distances, " Proc. Nat. Acad. Sci. USA, vol. 105, no. 28, pp. 9507-9511, 2008.
23. A. Singer and M. Cucuringu, Uniqueness of Low-Rank Matrix Completion by Rigidity Theory, 2009, submitted for publication.
24. C. Tomasi and T. Kanade, "Shape and motion from image streams under orthography: A factorization method, " Int. J. Comput. Vis., vol. 9, no. 2, pp. 137-154, 1992.
25. G. A. Watson, "Characterization of the subdifferential of some matrix norms, " Linear Algebra Appl., vol. 170, pp. 33-45, 1992.
26. C.-C. Weng, "Matrix completion for sensor networks, " Personal Communication, 2009.
27. E. Wigner, "Characteristic vectors of bordered matrices with infinite dimensions, " Ann. Math., no. 62, pp. 548-564, 1955.