The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Sparsest solutions of underdetermined linear systems via ℓq-minimization for 0<q⩽1
Open accessAbstract
We present a condition on the matrix of an underdetermined linear system which guarantees that the solution of the system with minimal l q -quasinorm is also the sparsest one. This generalizes, and slightly improves, a similar result for the l 1 -norm. We then introduce a simple numerical scheme to compute solutions with minimal l q -quasinorm, and we study its convergence. Finally, we display the results of some experiments which indicate that the l q -method performs better than other available methods.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
Stable signal recovery from incomplete and inaccurate measurements
Candès, E. J., Romberg, J. K., & Tao, T. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20124 · Cited by 7,036
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Candes, E. J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.885507 · Cited by 6,839
Enhancing Sparsity by Reweighted ℓ 1 Minimization
Candès, E. J., Wakin, M. B., & Boyd, S. P. (2008) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9045-x · Cited by 4,863
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
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
Stable recovery of sparse overcomplete representations in the presence of noise
Donoho, D. L., Elad, M., & Temlyakov, V. N. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.860430 · Cited by 2,183
Cited by
Sparse Unmixing of Hyperspectral Data
Iordache, M.-D., Bioucas-Dias, J. M., & Plaza, A. (2011) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2010.2098413 · Cited by 1,056
Computational Methods for Sparse Solution of Linear Inverse Problems
Tropp, J. A., & Wright, S. J. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2044010 · Cited by 1,046
Compressed sensing with coherent and redundant dictionaries
Candès, E. J., Eldar, Y. C., Needell, D., & Randall, P. (2011) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2010.10.002 · Cited by 898
A Probabilistic and RIPless Theory of Compressed Sensing
Candes, E. J., & Plan, Y. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2161794 · Cited by 598
Modified-CS: Modifying Compressive Sensing for Problems With Partially Known Support
Vaswani, N., & Lu, W. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2051150 · Cited by 517
Metadata
- Authors
- Foucart, S., & Lai, M.-J.
- Venue
- Applied and Computational Harmonic Analysis
- Publisher
- Elsevier BV
- Published
- 2009-05
- Volume
- 26
- Issue
- 3
- Pages
- 395-407
- ISSN
- 1063-5203 (ISSN-L)
- OpenAlex
- W2012961725
- Cited by
- 715
- References
- 14
- FWCI
- 36.06
- Type
- journal article
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Sparsest solutions of underdetermined linear systems via ℓq-minimization for 0<q⩽1. https://app.cochat.ai/papers/10.1016/j.acha.2008.09.001
- The paper
- Foucart, S., & Lai, M.-J. (2009). Sparsest solutions of underdetermined linear systems via ℓq-minimization for 0<q⩽1. Applied and Computational Harmonic Analysis. https://doi.org/10.1016/j.acha.2008.09.001
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.