k-sparse vector recovery via truncated _1 -_2 local minimization
From MaRDI portal
Publication:6181376
DOI10.1007/S11590-023-01991-0OpenAlexW4328128643MaRDI QIDQ6181376FDOQ6181376
Authors:
Publication date: 22 January 2024
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-023-01991-0
Recommendations
- k-Sparse Vector Recovery via $$\ell _1-\alpha \ell _2$$ Local Minimization
- A new sufficient condition for sparse vector recovery via \(\ell_1\)-\( \ell_2\) local minimization
- A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization
- Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization
- Enhanced block-sparse signal recovery performance via truncated \({\ell_2}/{\ell_{1-2}}\) minimization
compressed sensing\(\ell_1 -\ell_2\) minimization\(k\)-sparse vectorlocally recoverytruncated \(\ell_1 -\ell_2\) minimization
Cites Work
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Stable recovery of sparse overcomplete representations in the presence of noise
- Lower bound theory of nonzero entries in solutions of \(\ell_2-\ell_p\) minimization
- A mathematical introduction to compressive sensing
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\)
- Minimization of \(\ell_{1-2}\) for compressed sensing
- Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing
- RSP-Based Analysis for Sparsest and Least $\ell_1$-Norm Solutions to Underdetermined Linear Systems
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications
- New bounds on the restricted isometry constant \(\delta _{2k}\)
- A note on guaranteed sparse recovery via \(\ell_1\)-minimization
- Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
- Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization
- A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization
- Fast L1-L2 minimization via a proximal operator
- Sparse approximation using \(\ell_1-\ell_2\) minimization and its application to stochastic collocation
- Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization
- \(\ell_1-\alpha\ell_2\) minimization methods for signal and image reconstruction with impulsive noise removal
- Unconstrained \(\ell_1\)-\(\ell_2\) minimization for sparse recovery via mutual coherence
- A new sufficient condition for sparse vector recovery via \(\ell_1\)-\( \ell_2\) local minimization
- New restricted isometry property analysis for \(\ell_1-\ell_2\) minimization methods
Cited In (1)
This page was built for publication: \(k\)-sparse vector recovery via truncated \(\ell_1 -\ell_2\) local minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6181376)
