Consistency of \(\ell_1\) recovery from noisy deterministic measurements

DOI10.1016/j.acha.2013.08.001zbMath1287.94020arXiv1212.0369OpenAlexW1976323679MaRDI QIDQ2450946

Remi Tesson, Charles Dossal

Publication date: 26 May 2014

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1212.0369

zbMATH Keywords

consistencycompressibilitysparsity\(\ell_1\) minimizationdeterministic matrix

Mathematics Subject Classification ID

Linear regression; mixed models (62J05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items

Optimal dual certificates for noise robustness bounds in compressive sensing

Cites Work

• Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization
• Near-ideal model selection by \(\ell _{1}\) minimization
• The restricted isometry property and its implications for compressed sensing
• Norms of random submatrices and sparse approximation
• High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
• Necessary and sufficient conditions for linear convergence of ℓ1-regularization
• On Sparse Representations in Arbitrary Redundant Bases
• Recovery of Exact Sparse Representations in the Presence of Bounded Noise
• Greed is Good: Algorithmic Results for Sparse Approximation
• Just relax: convex programming methods for identifying sparse signals in noise
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)