Certifying the restricted isometry property is hard

IEEE Transactions on Information Theory

Volumn 59, Issue 6, 2013, Pages 3448-3450

  Bandeira, Afonso S ^a   Dobriban, Edgar ^b   Mixon, Dustin G ^c   Sawin, William F ^a  

^a PRINCETON UNIVERSITY   (United States)

^b STANFORD UNIVERSITY   (United States)

^c Air Force Institute of Technology   (United States)

Author keywords

Compressed sensing; computational complexity; restricted isometry property

Indexed keywords

NP-HARD; RESTRICTED ISOMETRY PROPERTIES; RESTRICTED ISOMETRY PROPERTIES (RIP);

COMPRESSED SENSING; COMPUTATIONAL COMPLEXITY; SIGNAL RECONSTRUCTION;

MATRIX ALGEBRA;

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

References (17)

1. E. J. Candès and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2005. (Pubitemid 41800353)
2. E. J. Candès, "The restricted isometry property and its implications for compressed sensing," C. R. Acad. Sci. Paris, Ser. I, vol. 346, pp. 589-592, 2008.
3. D. Needell and J. A. Tropp, "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples," Appl. Comput. Harmon. Anal., vol. 26, pp. 301-321, 2009.
4. T. Blumensath and M. E. Davies, "Iterative hard thresholding for compressed sensing," Appl. Comput. Harmon. Anal., vol. 27, pp. 265-274, 2009.
5. A. S. Bandeira, M. Fickus, D. G. Mixon, and P. Wong, The road to deterministic matrices with the restricted isometry property [Online]. Available: arXiv:1202.1234
6. R. DeVore, "Deterministic constructions of compressed sensing matrices," J. Complex., vol. 23, pp. 918-925, 2007.
7. T. Tao, Open Question: Deterministic UUP Matrices [Online]. Available: http://terrytao.wordpress.com/2007/07/02/open-question-deterministic-uup- matrices
8. P. Koiran and A. Zouzias, On the certification of the restricted isometry property [Online]. Available: arXiv: 1103.4984
9. P. Koiran and A. Zouzias, Hidden cliques and the certification of the restricted isometry property [Online]. Available: arXiv:1211.0665
10. A. M. Tillmann and M. E. Pfetsch, The computational complexity of the restricted isometry property, the nullspace property, and related concepts in compressed sensing [Online]. Available: arXiv:1205.2081
11. S. Cook, The P Versus NP Problem [Online]. Available: http://www. claymath.org/millennium/P-vs-NP/pvsnp.pdf
12. S. T. McCormick, "A combinatorial approach to some sparse matrix problems," Ph.D. dissertation, Stanford Univ., Stanford, CA, USA, 1983.
13. D. Marx, "A parameterized view on matroid optimization problems," Theor. Comput. Sci., vol. 410, pp. 4471-4479, 2009.
14. B. Alexeev, J. Cahill, and D. G.Mixon, "Full spark frames," J. Fourier Anal. Appl., vol. 18, pp. 1167-1194, 2012.
15. L. Khachiyan, "On the complexity of approximating extremal determinants in matrices," J. Complex., vol. 11, pp. 128-153, 1995.
16. J. Erickson, "New lower bounds for convex hull problems in odd dimensions," SIAM J. Comput., vol. 28, pp. 1198-1214, 1999.
17. A. Chistov, H. Fournier, L. Gurvits, and P. Koiran, "Vandermonde matrices, NP-completeness, and transversal subspaces," Found. Comput. Math, vol. 3, pp. 421-427, 2003. (Pubitemid 37503686)