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

Explore this paper's citation graph

Summary

It is shown 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 ,ϵ.

Type
article
Published
2006-07-01
Cited by
895
References
32

Keywords

Underdetermined system, Mathematics, Combinatorics, Norm (philosophy), Minification

References

Cited by

Related papers