The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
Open accessAbstract
This paper deals with the computational complexity of conditions which guarantee that the NP-hard problem of finding the sparsest solution to an underdetermined linear system can be solved by efficient algorithms. In the literature, several such conditions have been introduced. The most well-known ones are the mutual coherence, the restricted isometry property (RIP), and the nullspace property (NSP). While evaluating the mutual coherence of a given matrix is easy, it has been suspected for some time that evaluating RIP and NSP is computationally intractable in general. We confirm these conjectures by showing that for a given matrix${\mbi{A}}$and positive integer$k$, computing the best constants for which the RIP or NSP hold is, in general, NP-hard. These results are based on the fact that determining the spark of a matrix is NP-hard, which is also established in this paper. Furthermore, we also give several complexity statements about problems related to the above concepts.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Donoho, D. L. (2004) · Cited by 16,703
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
Decoding by Linear Programming
Candes, E. J., & Tao, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858979 · Cited by 7,121
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304010 · Cited by 6,845
Golub, G. H., & Loan, C. F. V. (1996) · Johns Hopkins University Press eBooks · Cited by 6,027
The restricted isometry property and its implications for compressed sensing
Candès, E. J. (2008) · Comptes Rendus. Mathématique · doi:10.1016/j.crma.2008.03.014 · Cited by 3,686
Greed is Good: Algorithmic Results for Sparse Approximation
Tropp, J. A. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834793 · Cited by 3,635
Geometric Algorithms and Combinatorial Optimization
Grötschel, M., Lovász, L., & Schrijver, A. (1988) · Algorithms and Combinatorics · doi:10.1007/978-3-642-97881-4 · Cited by 3,431
Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
Donoho, D. L., & Elad, M. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0437847100 · Cited by 2,898
Sparse Approximate Solutions to Linear Systems
Natarajan, B. K. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539792240406 · Cited by 2,783
A Simple Proof of the Restricted Isometry Property for Random Matrices
Baraniuk, R., Davenport, M., DeVore, R., & Wakin, M. (2008) · Constructive Approximation · doi:10.1007/s00365-007-9003-x · Cited by 2,372
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
Bruckstein, A. M., Donoho, D. L., & Elad, M. (2009) · SIAM Review · doi:10.1137/060657704 · Cited by 2,183
Uncertainty principles and ideal atomic decomposition
Donoho, D. L., & Huo, X. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.959265 · Cited by 1,949
Sparse and Redundant Representations: From Theory to Applications in Signal and Image Processing
Elad, M. (2010) · doi:10.1007/978-1-4419-7011-4 · Cited by 1,897
Brouwer, A. E., & Haemers, W. H. (2012) · Universitext · doi:10.1007/978-1-4614-1939-6 · Cited by 1,564
On the inherent intractability of certain coding problems (Corresp.)
Berlekamp, E., McEliece, R., & van Tilborg, H. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055873 · Cited by 1,523
Compressed sensing and best 𝑘-term approximation
Cohen, A., Dahmen, W., & DeVore, R. (2008) · Journal of the American Mathematical Society · doi:10.1090/s0894-0347-08-00610-3 · Cited by 1,002
Sparse representations in unions of bases
Gribonval, R., & Nielsen, M. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.820031 · Cited by 960
On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
Amaldi, E., & Kann, V. (1998) · Theoretical Computer Science · doi:10.1016/s0304-3975(97)00115-1 · Cited by 753
Sparsest solutions of underdetermined linear systems via ℓq-minimization for 0<q⩽1
Foucart, S., & Lai, M.-J. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2008.09.001 · Cited by 715
A Direct Formulation for Sparse PCA Using Semidefinite Programming
d'Aspremont, A., El Ghaoui, L., Jordan, M. I., & Lanckriet, G. R. G. (2007) · SIAM Review · doi:10.1137/050645506 · Cited by 678
Combinatorial optimization: Theory and algorithms
(2001) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(01)90023-9 · Cited by 600
Deterministic constructions of compressed sensing matrices
DeVore, R. (2007) · Journal of Complexity · doi:10.1016/j.jco.2007.04.002 · Cited by 591
Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
Davenport, M. A., & Wakin, M. B. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2054653 · Cited by 519
Numerical Linear Algebra and Optimization
Gill, P. E., Murray, W., & Wright, M. H. (2021) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611976571 · Cited by 506
Korte, B., & Vygen, J. (2000) · Algorithms and Combinatorics · doi:10.1007/978-3-662-21708-5 · Cited by 393
Finding a Minimum Circuit in a Graph
Itai, A., & Rodeh, M. (1978) · SIAM Journal on Computing · doi:10.1137/0207033 · Cited by 391
Optimal Solutions for Sparse Principal Component Analysis
d’Aspremont, A., Bach, F., & Ghaoui, L. E. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0707.0705 · Cited by 250
Explicit constructions of RIP matrices and related problems
Bourgain, J., Dilworth, S., Ford, K., Konyagin, S. V., & Kutzarova, D. (2011) · Duke Mathematical Journal · doi:10.1215/00127094-1384809 · Cited by 235
EXPLICIT CONSTRUCTIONS OF RIP MATRICES AND RELATED PROBLEMS
Bourgain, J., Dilworth, S. J., Ford, K., et al. (2010) · Cited by 232
The complexity and approximability of finding maximum feasible subsystems of linear relations
Amaldi, E., & Kann, V. (1995) · Theoretical Computer Science · doi:10.1016/0304-3975(94)00254-g · Cited by 201
Fornasier, M., & Rauhut, H. (2010) · Springer eBooks · doi:10.1007/978-0-387-92920-0_6 · Cited by 165
Compressed Sensing: How Sharp Is the Restricted Isometry Property?
Blanchard, J. D., Cartis, C., & Tanner, J. (2011) · SIAM Review · doi:10.1137/090748160 · Cited by 160
Alexeev, B., Cahill, J., & Mixon, D. G. (2012) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-012-9235-4 · Cited by 138
Conditional Gradient Algorithmsfor Rank-One Matrix Approximations with a Sparsity Constraint
Luss, R., & Teboulle, M. (2013) · SIAM Review · doi:10.1137/110839072 · Cited by 96
Improved Bounds on Restricted Isometry Constants for Gaussian Matrices
Bah, B., & Tanner, J. (2010) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/100788884 · Cited by 78
Testing the nullspace property using semidefinite programming
d’Aspremont, A., & Ghaoui, L. E. (2010) · Mathematical Programming · doi:10.1007/s10107-010-0416-0 · Cited by 77
A Combinatorial Approach to Some Sparse Matrix Problems.
McCormick, S. T. (1983) · doi:10.21236/ada131387 · Cited by 49
Precisely Verifying the Null Space Conditions in Compressed Sensing: A Sandwiching AlgorithmPreprint
Cho, M., & Xu, W. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1306.2665 · Cited by 2
Cited by
Secure Control Systems: A Quantitative Risk Management Approach
(2015) · IEEE Control Systems · doi:10.1109/mcs.2014.2364709 · Cited by 316
Metadata
- Authors
- Tillmann, A. M., & Pfetsch, M. E.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2014-02
- Volume
- 60
- Issue
- 2
- Pages
- 1248-1259
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2122340891
- Cited by
- 389
- References
- 41
- FWCI
- 26.79
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.