On the optimality of a L1/L1 solver for sparse signal recovery from sparsely corrupted compressive measurements
Abstract
This short note proves the 2-1 instance optimality of a 1/1 solver, i.e a variant of basis pursuit denoising with a 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.