Uniqueness conditions for low-rank matrix recovery

Applied and Computational Harmonic Analysis

Volumn 33, Issue 2, 2012, Pages 309-314

  Eldar, Y C ^a   Needell, D ^b   Plan, Y ^c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b CLAREMONT MCKENNA COLLEGE   (United States)

^c Department of Mathematics ^*  (United States)

Author keywords

Compressed sensing; Low rank matrix recovery; Nuclear norm minimization; Random matrices; Rank minimization

Indexed keywords

COMPRESSED SENSING; HARMONIC ANALYSIS; MATHEMATICAL TECHNIQUES;

GAUSSIAN MEASUREMENTS; LINEAR MEASUREMENTS; LOW-RANK MATRICES; LOW-RANK MATRIX RECOVERIES; NUCLEAR NORM MINIMIZATIONS; RANDOM MATRICES; RANDOM MEASUREMENT; RANK MINIMIZATIONS;

RECOVERY;

EID: 84865634860     PISSN: 10635203     EISSN: 1096603X     Source Type: Journal    
DOI: 10.1016/j.acha.2012.04.002     Document Type: Letter

References (18)

1. J.F. Cai, E.J. Candès, Z. Shen, A singular value thresholding algorithm for matrix completion, SIAM J. Optim. 20 (4) (2008) 1956-1982.
2. E.J. Candès, Y. Plan, Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements, IEEE Trans. Inform. Theory 57 (4) (2010) 2342-2359.
3. E.J. Candès, Y. Plan, Matrix completion with noise, Proc. IEEE 98 (6) (2010) 925-936.
4. E.J. Candès, B. Recht, Exact matrix completion via convex optimization, Found. Comput. Math. 9 (6) (2009) 717-772.
5. E.J. Candès, J. Romberg, T. Tao, Robust uncertainty principles: Exact signal reconstruction from highly incomplete Fourier information, IEEE Trans. Inform. Theory 52 (2) (2006) 489-509. (Pubitemid 43174093)
6. W. Dai, O. Milenkovic, SET: An algorithm for consistent matrix completion, in: ICASSP 2010 IEEE Int. Conf., IEEE, 2010, pp. 3646-3649.
7. D. Gross, Recovering low-rank matrices from few coefficients in any basis, IEEE Trans. Inform. Theory 57 (3) (2011) 1548-1566.
8. K. Lee, Y. Bresler, Admira: Atomic decomposition for minimum rank approximation, IEEE Trans. Inform. Theory 56 (9) (2010) 4402-4416.
9. G.G. Lorentz, M. von Golitschek, Y. Makovoz, Constructive Approximation: Advanced Problems, Springer, Berlin, 1996.
10. S. Ma, D. Goldfarb, L. Chen, Fixed point and Bregman iterative methods for matrix rank minimization, Math. Program. (2009) 1-33.
11. R. Meka, P. Jain, I.S. Dhillon, Guaranteed rank minimization via singular value projection, in: Proc. Neural Information Processing Systems (NIPS), December 2010, pp. 937-945.
12. S. Negahban, P. Ravikumar, M.J. Wainwright, B. Yu, A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers, in: Advances in Neural Information Processing Systems (NIPS), 2009.
13. S. Oymak, B. Hassibi, New null space results and recovery thresholds for matrix rank minimization, available at http://arxiv.org/abs/1011.6326, 2010, submitted for publication.
14. S. Oymak, B. Hassibi, Tight recovery thresholds and robustness analysis for matrix rank minimization, submitted for publication.
15. P.A. Parrilo, A.S. Willsky, V. Chandrasekaran, B. Recht, The convex geometry of linear inverse problems, available at http://arxiv.org/abs/1012. 0621, 2010.
16. B. Recht, personal communication, March 2011.
17. B. Recht, M. Fazel, P.A. Parrilo, Guaranteed minimum rank solutions to linear matrix equations via nuclear norm minimization, SIAM Rev. 52 (3) (2010) 471-501.
18. V.Y.F. Tan, L. Balzano, S.C. Draper, Rank minimization over finite fields: Fundamental limits and coding-theoretic interpretations, IEEE Trans. Inform. Theory 58 (4) (2012) 2018-2039.