A unified approach to convergence rates for ℓ1-regularization and lacking sparsity
Not on the map. Why?
Abstract (arXiv)
In ℓ1-regularization, which is an important tool in signal and image processing, one usually is concerned with signals and images having a sparse representation in some suitable basis, e.g. in a wavelet basis. Many results on convergence and convergence rates of sparse approximate solutions to linear ill-posed problems are known, but rate results for the ℓ1-regularization in case of lacking sparsity had not been published until 2013. In the last two years, however, two articles appeared providing sufficient conditions for convergence rates in case of non-sparse but almost sparse solutions. In the present paper, we suggest a third sufficient condition, which unifies the existing two and, by the way, also incorporates the well-known restricted isometry property.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 4 Jun 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1.
1 paper.
- 2022Stability of Image-Reconstruction Algorithmscited by 7
- 2022Stability of Image-Reconstruction Algorithms14 Jun 2022