Efficient and guaranteed rank minimization by atomic decomposition

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 314-318

  Lee, Kiryung ^a   Bresler, Yoram ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

ATOMIC DECOMPOSITION; COMPUTATIONALLY EFFICIENT; CONVEX PROBLEMS; LOW RANK APPROXIMATIONS; MATRIX; MINIMIZATION PROBLEMS; PERFORMANCE GUARANTEES;

INFORMATION THEORY; OPTIMIZATION;

APPROXIMATION ALGORITHMS;

EID: 70449477017     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5205530     Document Type: Conference Paper

References (15)

1. B. Recht, M. Fazel, and P. Parrilo, Arxiv preprint arXiv:0706.4138, 2007.
2. M. Fazel, H. Hindi, and S. Boyd, in Proc. American Control Conference, vol. 6, 2001, pp. 4734-4739.
3. Z. Liu and L. Vandenberghe, submitted to Math Prog., 2008.
4. J. Cai, E. Candes, and Z. Shen, Arxiv preprint arXiv:0810.3286, 2008.
5. S. Ma, D. Goldfarb, and L. Chen, Dep. of IEOR, Columbia Univ., Tech. Rep., Oct. 2008.
6. R. Meka, P. Jain, C. Caramanis, and I. Dhillon, TR-08-23. The Univ. of Texas at Austin, Dept. of Comp. Sci, 2008.
7. D. Needell and J. Tropp, Arxiv preprint arXiv:0803.2392, 2008.
8. W. Dai and O. Milenkovic, Arxiv preprint arXiv:0803.0811, 2008.
9. R. Baraniuk, V. Cevher, M. Duarte, and C. Hegde, Arxiv preprint arXiv:0808.3572, 2008.
10. S. Mallat and Z. Zhang, IEEE Trans. on Sig. Proc., vol. 41, no. 12, pp. 3397-3415, 1993.
11. Y. Pati, R. Rezaiifar, and P. Krishnaprasad, in Proc. Asilomar Conf. on Signals, Systems, and Computers, vol. 1, Nov. 1993, pp. 40-44.
12. E. Candes, Comptes rendus-Mathématique, vol. 346, no. 9-10, pp. 589-592, 2008.
13. R. Lehoucq, D. Sorensen, and C. Yang, "ARPACK Users' Guide".
14. S. Har-Peled, "Low rank matrix approximation in linear time," note, 2006.
15. K. Lee and Y. Bresler, Arxiv preprint arXiv:0905.0044, 2009.