A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization
From MaRDI portal
Publication:2667049
DOI10.1016/j.acha.2021.09.003zbMath1485.90095OpenAlexW3202393546MaRDI QIDQ2667049
Publication date: 23 November 2021
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.acha.2021.09.003
Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items
\(\boldsymbol{L_1-\beta L_q}\) Minimization for Signal and Image Recovery, Enhanced total variation minimization for stable image reconstruction, \(k\)-sparse vector recovery via truncated \(\ell_1 -\ell_2\) local minimization
Cites Work
- DC approximation approaches for sparse optimization
- A mathematical introduction to compressive sensing
- The bounds of restricted isometry constants for low rank matrices recovery
- Stable recovery of sparse signals via \(\ell_p\)-minimization
- Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\)
- The restricted isometry property and its implications for compressed sensing
- Sparse recovery by non-convex optimization - instance optimality
- A note on guaranteed sparse recovery via \(\ell_1\)-minimization
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC programming and DCA: thirty years of developments
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization
- A Method for Finding Structured Sparse Solutions to Nonnegative Least Squares Problems with Applications
- Decoding by Linear Programming
- Iteratively reweighted least squares minimization for sparse recovery
- Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
- A new sufficient condition for sparse vector recovery via ℓ1 − ℓ2 local minimization
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- The Improved Bounds of Restricted Isometry Constant for Recovery via <formula formulatype="inline"><tex Notation="TeX">$\ell_{p}$</tex> </formula>-Minimization
- Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing
