Subspace evolution and transfer (SET) for low-rank Matrix completion

IEEE Transactions on Signal Processing

Volumn 59, Issue 7, 2011, Pages 3120-3132

  Dai, Wei ^a   Milenkovic, Olgica ^b   Kerman, Ely ^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

Grassmann manifold; linear subspace; matrix completion; non convex optimization

Indexed keywords

COLUMN SPACE; EMPIRICAL PERFORMANCE; GRADIENT DESCENT ALGORITHMS; GRADIENT DESCENT METHOD; GRASSMANN MANIFOLD; INCOMPLETE OBSERVATION; LINEAR SUBSPACE; LOW-RANK MATRICES; MATRIX COMPLETION; NEW MECHANISMS; NONCONVEX OPTIMIZATION; SAMPLING RATES; SET ALGORITHM;

CONVEX OPTIMIZATION;

ALGORITHMS;

EID: 79959203326     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2011.2144977     Document Type: Article

References (24)

1. M. Fazel, "Matrix rank minimization with applications," Ph.D. dissertation, Stanford Univ., Stanford, CA, 2002.
2. E. Candes and B. Recht, "Exact matrix completion via convex optimization," Found. Comput. Math., vol. 9, pp. 717-772, 2009.
3. E. J. Candes and T. Tao, "The power of convex relaxation: Near-optimal matrix completion," IEEE Trans. Inf. Theory, vol. 56, pp. 2053-2080, May 2010.
4. D. Gross, Recovering low-rank matrices from few coefficients in any basis vol. 57, no. 3, pp. 1548-1566, 2011.
5. S. Negahban and M. J. Wainwright, "Restricted strong convexity and weighted matrix completion: Optimal bounds with noise," [Online]. Available: arXiv:1009.2118 2010
6. J. Cai, E. J. Candes, and Z. Shen, "A singular value thresholding algorithm for matrix completion," SIAM J. Optim., vol. 20, pp. 1956-1982, 2010.
7. E. J. Candès, X. Li, Y. Ma, and J. Wright, "Robust principal component analysis?" [Online]. Available: arXiv:0912.3599 2009
8. K.-C. Toh and S. Yun, "An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems," preprint, 2009.
9. S. Ma, D. Goldfarb, and L. Chen, "Fixed point and Bregman iterative methods for matrix rank minimization," Math. Program., Sep. 2009.
10. K. Lee and Y. Bresler, "ADMiRA: Atomic decomposition for minimum rank approximation," IEEE Trans. Inf. Theory, vol. 56, pp. 4402-4416, Sep. 2010.
11. W. Dai and O. Milenkovic, "Subspace pursuit for compressive sensing signal reconstruction," IEEE Trans. Inf. Theory, vol. 55, pp. 2230-2249, May 2009.
12. D. Needell and J. A. Tropp, "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples," Appl. Computat. Harmon. Anal., vol. 26, pp. 301-321, May 2009.
13. R. Meka, P. Jain, and I. S. Dhillon, "Guaranteed rank minimization via singular value projection," [Online]. Available: arXiv:0909.5457 2009
14. T. Blumensath and M. E. Davies, "Iterative hard thresholding for compressed sensing," Appl. Computat. Harmon. Anal., vol. 27, pp. 265-274, Nov. 2009.
15. J. Haldar and D. Hernando, "Rank-constrained solutions to linear matrix equations using power factorization," IEEE Signal Process. Lett., pp. 16:584-16:587, 2009.
16. R. H. Keshavan, A. Montanari, and S. Oh, "Matrix completion from a few entries," [Online]. Available: arXiv:0901.3150 2009
17. W. Dai, E. Kerman, and O. Milenkovic, "A geometric approach to low-rank matrix completion," [Online]. Available: arXiv:1006.2086 2010
18. J. H. Manton, R. Mahony, and Y. Hua, "The geometry of weighted low-rank approximations," IEEE Trans. Signal Process., vol. 51, pp. 500-514, Feb. 2003.
19. A. Edelman, T. Arias, and S. T. Smith, "The geometry of algorithms with orthogonality constraints," SIAM J. Matrix Anal. Appl., vol. 20, pp. 303-353, Apr. 1999. (Pubitemid 129333771)
20. P. E. Gill, W. Murray, and M. H. Wright, Practical Optimization. New York: Academic, 1982.
21. R. H. Keshavan, A. Montanari, and S. Oh, "Matrix completion from noisy entries," [Online]. Available: arXiv:0906.2027 2009
22. J. Nocedal and S. Wright, Numerical Optimization. New York: Springer, 2000.
23. W. Dai, Y. Liu, and B. Rider, "Quantization bounds on Grassmann manifolds and applications to MIMO communications," IEEE Trans. Inf. Theory, vol. 54, pp. 1108-1123, March 2008. (Pubitemid 351418908)
24. W. Dai, B. Rider, and Y. Liu, "Volume growth and general rate quantization on Grassmann manifolds," in Proc. IEEE Global Telecommun. Conf. (IEEE GLOBECOM), Nov. 26-30, 2007, pp. 1441-1445.