Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 634

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

For most large underdetermined systems of equations, the minimal 𝓁1‐norm near‐solution approximates the sparsest near‐solution

Donoho, David L.·2006·Communications on Pure and Applied Mathematics

Abstract

We consider inexact linear equations y≈ Φ x where y is a given vector in ℝn, Φ is a given n×m matrix, and we wish to find x0,ϵ as sparse as possible while obeying ‖y− Φ x0,ϵ‖2≤ ϵ. In general, this requires combinatorial optimization and so is considered intractable. On the other hand, the 𝓁 1‐minimization problem is convex and is considered tractable. We show that for most Φ, if the optimally sparse approximation x0,ϵ is sufficiently sparse, then the solution x1,ϵ of the 𝓁 1‐minimization problem is a good approximation to x0,ϵ. We suppose that the columns of Φ are normalized to the unit 𝓁 2‐norm, and we place uniform measure on such Φ. We study the underdetermined case where m∼ τ n and τ > 1, and prove the existence of ρ = ρ(τ) > 0 and C=C(ρ, τ) so that for large n and for all Φ's except a negligible fraction, the following approximate sparse solution property of Φ holds:for every y having an approximation‖y− Φ x0‖2≤ ϵ by a coefficient vector x0∈ ℝmwith fewer than ρ · n nonzeros, This has two implications. First, for most Φ, whenever the combinatorial optimization result x0,ϵ would be very sparse,x1,ϵ is a good approximation to x0,ϵ. Second, suppose we are given noisy data obeying y= Φ x0+z where the unknown x0 is known to be sparse and the noise ‖z‖2≤ ϵ. For most Φ, noise‐tolerant 𝓁 1‐minimization will stably recover x0 from y in the presence of noise z. We also study the barely determined case m=n and reach parallel conclusions by slightly different arguments. Proof techniques include the use of almost‐spherical sections in Banach space theory and concentration of measure for eigenvalues of random matrices. © 2006 Wiley Periodicals, Inc.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1002/cpa.20131

Cites

2 of 2 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 2 references

Cited by

See all 634

Metadata

Authors
Donoho, D. L.
Venue
Communications on Pure and Applied Mathematics
Publisher
Wiley
Published
2006-03-21
Volume
59
Issue
7
Pages
907-934
ISSN
  • 0010-3640 (ISSN-L)
  • 1097-0312
OpenAlex
W2114147096
Cited by
634
References
2
FWCI
49.40
Type
journal article
Language
en
Open access
closed

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: For most large underdetermined systems of equations, the minimal 𝓁1‐norm near‐solution approximates the sparsest near‐solution. https://app.cochat.ai/papers/10.1002/cpa.20131
The paper
Donoho, D. L. (2006). For most large underdetermined systems of equations, the minimal 𝓁1‐norm near‐solution approximates the sparsest near‐solution. Communications on Pure and Applied Mathematics. https://doi.org/10.1002/cpa.20131

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.