Sparse recovery by non-convex optimization - instance optimality
From MaRDI portal
Publication:984656
DOI10.1016/j.acha.2009.08.002zbMath1200.90158MaRDI QIDQ984656
Publication date: 20 July 2010
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.acha.2009.08.002
instance optimality; compressed sensing; sparse reconstruction; compressive sampling; \(\ell ^{1}\) minimization; \(\ell ^p\) minimization; instance optimality in probability
90C30: Nonlinear programming
Related Items
Recovery of sparsest signals via \(\ell^q \)-minimization, Perturbations of measurement matrices and dictionaries in compressed sensing, Restricted \(p\)-isometry property and its application for nonconvex compressive sensing, On support sizes of restricted isometry constants, Restricted \(p\)-isometry properties of partially sparse signal recovery, Compressed sensing of color images, A sharp RIP condition for orthogonal matching pursuit, EXACT LOW-RANK MATRIX RECOVERY VIA NONCONVEX SCHATTEN p-MINIMIZATION, CURVELET-WAVELET REGULARIZED SPLIT BREGMAN ITERATION FOR COMPRESSED SENSING
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Highly sparse representations from dictionaries are unique and independent of the sparseness measure
- The restricted isometry property and its implications for compressed sensing
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- A simple test to check the optimality of a sparse signal approximation
- A simple proof of the restricted isometry property for random matrices
- Banach-Mazur distances and projections on p-convex spaces
- Stability and instance optimality for Gaussian measurements in compressed sensing
- Compressed sensing and best 𝑘-term approximation
- Restricted isometry properties and nonconvex compressive sensing
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Recovery of Short, Complex Linear Combinations Via<tex>$ell _1$</tex>Minimization
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Iteratively reweighted least squares minimization for sparse recovery
- Atomic Decomposition by Basis Pursuit
- Uncertainty principles and ideal atomic decomposition
- Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
