A geometric approach to low-rank matrix completion

IEEE Transactions on Information Theory

Volumn 58, Issue 1, 2012, Pages 237-247

  Dai, Wei ^a   Kerman, Ely ^b   Milenkovic, Olgica ^c  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^c University of Illinois at Urbana Champaign   (United States)

Author keywords

Gradient search; Grassmann manifold; low rank matrix completion; nonconvex optimization; performance guarantee

Indexed keywords

GRADIENT SEARCH; GRASSMANN MANIFOLD; LOW-RANK MATRICES; NONCONVEX OPTIMIZATION; PERFORMANCE GUARANTEES;

COMPUTER APPLICATIONS; INFORMATION THEORY;

OPTIMIZATION;

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

References (25)

1. D. Donoho, "Compressed sensing," IEEE Trans. Inf. . Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
2. E. 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. (Pubitemid 43174093)
3. E. Candès and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2005. (Pubitemid 41800353)
4. B. Recht, M. Fazel, and P. A. Parrilo, "Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization," SIAM Rev., vol. 52, no. 3, pp. 471-501, 2010.
5. E. Candès and B. Recht, "Exact matrix completion via convex optimization," Found. Comput. Math., vol. 9, pp. 717-772, 2009.
6. E. Candes and T. Tao, "The power of convex relaxation: Near-optimal matrix completion," IEEE Trans. Inf. Theory, vol. 56, no. 5, pp. 2053-2080, May 2010.
7. V. Chandrasekaran, S. Sanghavi, P. A. Parrilo, and A. S. Willsky, "Rank-sparsity incoherence for matrix decomposition," SIAM J. Optimiz., vol. 21, no. 2, pp. 572-596, 2011.
8. E. J. Candes and Y. Plan, "Matrix completion with noise," Proc. IEEE, vol. 98, no. 6, pp. 925-936, Jun. 2010.
9. J. Cai, E. J. Candes, and Z. Shen, "A singular value thresholding algorithm for matrix completion," SIAM J. Optimiz., vol. 20, no. 4, pp. 1956-1982, 2010.
10. K. Lee and Y. Bresler, "ADMiRA: Atomic decomposition for minimum rank approximation," IEEE Trans. Inf. Theory, vol. 56, no. 9, pp. 4402-4416, Sep. 2010.
11. W. Dai and O. Milenkovic, "Subspace pursuit for compressive sensing signal reconstruction," IEEE Trans. Inf. Theory, vol. 55, no. 5, pp. 2230-2249, May 2009.
12. D. Needell and J. A. Tropp, "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples," Appl. and Comput. Harmonic Anal., vol. 26, pp. 301-321, May 2009.
13. R. Meka, P. Jain, and I. S. Dhillon, Guaranteed Rank Minimization via Singular Value Projection 2009[Online]. Available: arXiv:0909.5457
14. T. Blumensath and M. E. Davies, "Iterative hard thresholding for compressed sensing," Appl. and Comput. Harmonic Anal., vol. 27, pp. 265-274, Nov. 2009.
15. J. Haldar and D. Hernando, "Rank-constrained solutions to linear matrix equations using powerfactorization," IEEE Signal Process. Lett., vol. 16, no. 7, pp. 584-587, Jul. 2009.
16. R. H. Keshavan, A. Montanari, and S. Oh, "Matrix completion from a few entries," IEEE Trans. Inf. Theory, vol. 56, no. 6, pp. 2980-2998, Jun. 2010.
17. W. Dai and O. Milenkovic, "SET: An algorithm for consistent matrix completion," in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing (ICASSP), Mar. 2010.
18. A. Edelman, T. Arias, and S. T. Smith, "The geometry of algorithms with orthogonality constraints," SIAM J. Matrix Anal. and Applic., vol. 20, pp. 303-353, Apr. 1999.
19. P.-A. Absil, R. Mahony, and R. Sepulchre, Optimization Algorithms on Matrix Manifolds. Princeton, NJ: Princeton University Press, 2008.
20. J. H. Conway, R. H. Hardin, and N. J. A. Sloane, "Packing lines, planes, etc., packing in Grassmannian spaces," Exper. Math., vol. 5, pp. 139-159, 1996.
21. W. Dai, Y. Liu, and B. Rider, "Quantization bounds on Grassmann manifolds and applications to mimo communications," IEEE Trans. Inf. Theory, vol. 54, no. 3, pp. 1108-1123, Mar. 2008. (Pubitemid 351418908)
22. A. T. James, "Normal multivariate analysis and the orthogonal group," Ann. Math. Statist., vol. 25, no. 1, pp. 40-75, 1954.
23. M. Adler and P. van Moerbeke, "Integrals over Grassmannians and random permutations," Adv. in Math., vol. 181, no. 1, pp. 190-249, 2004. (Pubitemid 38074359)
24. W. Dai, B. Rider, and Y. Liu, "Volume growth and general rate quantization on Grassmann manifolds," in Proc. IEEE Global Telecommunications Conf. (Globecom), Nov. 26-30, 2007, pp. 1441-1445.
25. L. Balzano, R. Nowak, and B. Recht, Online Identification and Tracking of Subspaces from Highly Incomplete Information, 2010, to be published.