The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Sparse nonnegative solution of underdetermined linear equations by linear programming
Open accessAbstract
Consider an underdetermined system of linear equations y=Ax with known y and d×n matrix A. We seek the nonnegative x with the fewest nonzeros satisfying y=Ax. In general, this problem is NP-hard. However, for many matrices A there is a threshold phenomenon: if the sparsest solution is sufficiently sparse, it can be found by linear programming. We explain this by the theory of convex polytopes. Let a jdenote the j th column of A, 1 ≤j≤n, let a0= 0 and P denote the convex hull of the a j. We say the polytope P is outwardly k-neighborly if every subset of k vertices not including 0 spans a face of P. We show that outward k-neighborliness is equivalent to the statement that, whenever y=Ax has a nonnegative solution with at most k nonzeros, it is the nonnegative solution to y=Ax having minimal sum. We also consider weak neighborliness, where the overwhelming majority of k-sets of a js not containing 0 span a face of P. This implies that most nonnegative vectors x with k nonzeros are uniquely recoverable from y=Ax by linear programming. Numerous corollaries follow by invoking neighborliness results. For example, for most large n by 2 n underdetermined systems having a solution with fewer nonzeros than roughly half the number of equations, the sparsest solution can be found by linear programming.
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
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
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
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
Self-citationSparse representations in unions of bases
Gribonval, R., & Nielsen, M. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.820031 · Cited by 960
Grünbaum, B. (2003) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-0019-9 · Cited by 700
A generalized uncertainty principle and sparse representation in pairs of bases
Elad, M., & Bruckstein, A. M. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.801410 · Cited by 673
Über den variabilitätsbereich der fourier’schen konstanten von positiven harmonischen funktionen
Carathéodory, C. (1911) · Rendiconti del Circolo Matematico di Palermo · doi:10.1007/bf03014795 · Cited by 564
On Sparse Representations in Arbitrary Redundant Bases
Fuchs, J.-J. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.828141 · Cited by 563
Über den Variabilitätsbereich der Koeffizienten von Potenzreihen, die gegebene Werte nicht annehmen
Carathéodory, C. (1907) · Mathematische Annalen · doi:10.1007/bf01449883 · Cited by 500
Convex polytopes and the upper bound conjecture
McMullen, P., Shephard, G. C., Reeve, J. E., & Ball, A. (1971) · Cambridge University Press eBooks · Cited by 394
Maximum Entropy and the Nearly Black Object
Donoho, D. L., Johnstone, I. M., Hoch, J. C., & Stern, A. S. (1992) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1992.tb01864.x · Cited by 393
Self-citationHigh-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension
Donoho, D. L. (2006) · Discrete & Computational Geometry · doi:10.1007/s00454-005-1220-0 · Cited by 370
Self-citationKarlin, S., & Shapley, L. S. (1953) · Memoirs of the American Mathematical Society · doi:10.1090/memo/0012 · Cited by 207
Random projections of regular simplices
Affentranger, F., & Schneider, R. (1992) · Discrete & Computational Geometry · doi:10.1007/bf02187839 · Cited by 114
Regular simplices and Gaussian samples
Baryshnikov, Y. M., & Vitale, R. A. (1994) · Discrete & Computational Geometry · doi:10.1007/bf02574000 · Cited by 55
Cited by
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Recht, B., Fazel, M., & Parrilo, P. A. (2010) · SIAM Review · doi:10.1137/070697835 · Cited by 3,471
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
Self-citationIteratively reweighted least squares minimization for sparse recovery
Daubechies, I., DeVore, R., Fornasier, M., & Güntürk, C. S. (2010) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20303 · Cited by 1,295
Towards a Mathematical Theory of Super‐resolution
Candès, E. J., & Fernandez‐Granda, C. (2014) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.21455 · Cited by 1,169
Compressed Sensing Off the Grid
Tang, G., Bhaskar, B. N., Shah, P., & Recht, B. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2277451 · Cited by 1,163
Metadata
- Authors
- Donoho, D. L., & Tanner, J.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2005-06-23
- Volume
- 102
- Issue
- 27
- Pages
- 9446-9451
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2163916252
- Cited by
- 577
- References
- 15
- FWCI
- 20.87
- 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.