On the optimality of a L1/L1 solver for sparse signal recovery from sparsely corrupted compressive measurements
classification
💻 cs.IT
math.IT
keywords
compressivecorruptedmeasurementsoptimalitysolversparsesparselyapplied
read the original abstract
This short note proves the $\ell_2-\ell_1$ instance optimality of a $\ell_1/\ell_1$ solver, i.e a variant of \emph{basis pursuit denoising} with a $\ell_1$ fidelity constraint, when applied to the estimation of sparse (or compressible) signals observed by sparsely corrupted compressive measurements. The approach simply combines two known results due to Y. Plan, R. Vershynin and E. Cand\`es.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.