A simplified approach to recovery conditions for low rank matrices

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2011, Pages 2318-2322

  Oymak, Samet ^a   Mohan, Karthik ^b   Fazel, Maryam ^b   Hassibi, Babak ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

rank minimization; sparse recovery

Indexed keywords

LINEAR MEASUREMENTS; LOW-RANK MATRICES; MATRIX RECOVERY; RANK MINIMIZATION; RECONSTRUCTION ALGORITHMS; SINGULAR VALUES; SPARSE RECOVERY; SPARSE VECTORS;

ALGORITHMS; INFORMATION THEORY;

RECOVERY;

EID: 80054798737     PISSN: 21578104     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2011.6033976     Document Type: Conference Paper

References (31)

1. T. T. Cai, G. Xu, and J. Zhang. New bounds for restricted isometry constants. IEEE Tran. Info. Theory, 56:4388-4394, 2010.
2. T. T. Cai, G. Xu, and J. Zhang. Shifting inequality and recovery of sparse signals. IEEE Tran. Signal Processing, 58:1300-1308, 2010.
3. E. J. Candes. The restricted isometry property and its implications for compressed sensing. Academie des Sciences, 346:589-592, 2008.
4. EJ. Candes and Y. Plan. Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements. 2009.
5. EJ. Candes and T. Tao. Decoding by linear programming. IEEE Trans Info. Theory, 51:4203-4215, 2004.
6. 1 minimization. Journal of Fourier Analysis and Applications, 14:877-905, 2008.
7. R. Chartrand and V. Staneva. Restricted isometry properties and nonconvex compressive sensing. Inverse Problems, 24:1-14, 2008.
8. R. Chartrand and W. Yin. Iteratively reweighted algorithms for compressive sensing. In 33rd International Conference on Acoustics, Speech, and Signal Processing (ICASSP), 2008.
9. A. Cohen, W. Dahmen, and R. Devore. Compressed sensing and best k-term approximation. Journal of the American Mathematical Society, 22(1):211-231, 2009.
10. I. Daubechies, R. DeVore, M. Fornasier, and C. S. Gunturk. Iteratively re-weighted least squares minimization for sparse recovery. Commun. Pure Appl. Math, 63(1), 2010.
11. D. L. Donoho and X. Huo. Uncertainty principles and ideal atomic decomposition. IEEE Trans. on Info. Theory, 47(7), 2001.
12. K. Dvijotham and M. Fazel. A nullspace analysis of the nuclear norm heuristic for rank minimization. In Proc. of ICASSP, 2010.
13. M. Elad and A. M. Bruckstein. A generalized uncertainty principle and sparse representation in pairs of bases. IEEE Trans. on Info. Theory, 48(8), 2002.
14. A. Feuer and A. Nemirovsky. On sparse representation in pairs of bases. IEEE Trans. on Info. Theory, 49(6), 2003.
15. q minimization for 0 < q < 1, 2009.
16. R. Garg and R. Khandekar. Gradient descent with sparsification: An iterative algorithm for sparse recovery with restricted isometry property. In Proc. of 26th Annual ICML, 2009.
17. R. Gribonval and M. Nielsen. Sparse representations in unions of bases. IEEE Trans. on Info. Theory, 49(12):3320-3325, 2003.
18. R. A. Horn and C. R. Johnson. Matrix Analysis. 1990.
19. R. A. Horn and C. R. Johnson. Topics in Matrix Analysis. 1990.
20. K. Lee and Y. Bresler. Admira: Atomic decomposition for minimum rank approximation. 2009. Available at http://arxiv.org/abs/0905.0044.
21. R. Meka, P. Jain, and I. S. Dhillon. Guaranteed rank minimization via singular value projection. In Proc. of NIPS, 2010.
22. K. Mohan and M. Fazel. Iterative reweighted least squares for matrix rank minimization. In Proc. Allerton conference on Controls and communications, 2010.
23. K. Mohan and M. Fazel. New restricted isometry results for noisy recovery. In Proc. International Symposium Information Theory, 2010.
24. D. Needell. Noisy signal recovery via iterative reweighted l1-minimization. In Proc. Asilomar conference on Signals, Systems and Computers, 2009. Available at http://arxiv.org/abs/0904.3780.
25. D. Needell and J. A. Tropp. Cosamp: Iterative signal recovery from incomplete and inaccurate samples. Available at http://arxiv.org/abs/0905. 0044Submittedon17Mar2008.
26. S. Oymak and B. Hassibi. New null space results and recovery thresholds for matrix rank minimization. 2010. Available at http://arxiv.org/abs/1011.6326.
27. S. Oymak, K. Mohan, M. Fazel, and B. Hassibi. A simplified approach to recovery conditions for low rank matrices. 2011. Available at http://arxiv.org/abs/1103.1178.
28. B. Recht, M. Fazel, and P. Parrilo. Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Review, 52:471-501, 2010.
29. M. Uchiyama. Subadditivity of eigenvalue sums. Proc. American Mathematical Society, pages 1405-1412, 2005.
30. p minimization. 2010. Available at http://arxiv.org/abs/1011.5936.
31. 1 minimization: A Non-RIP analysis and extensions. 2008. Technical Report TR08-11 revised. Available at http://www.caam.rice.edu/?zhang/reports/tr0811-revised.pdf.