Sparse recovery by non-convex optimization - instance optimality

DOI10.1016/j.acha.2009.08.002zbMath1200.90158OpenAlexW2072327470MaRDI QIDQ984656

Özgür Yılmaz, Rayan Saab

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

zbMATH Keywords

instance optimalitycompressed sensingsparse reconstructioncompressive sampling\(\ell ^{1}\) minimization\(\ell ^p\) minimizationinstance optimality in probability

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery ⋮ Sparse signal recovery via non-convex optimization and overcomplete dictionaries ⋮ Unnamed Item ⋮ Quantization of compressive samples with stable and robust recovery ⋮ A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization ⋮ Recovery of sparsest signals via \(\ell^q \)-minimization ⋮ Stability of lq-analysis based dual frame with Weibull matrices for 0 < q ≤ 1 ⋮ Perturbations of measurement matrices and dictionaries in compressed sensing ⋮ Restricted \(p\)-isometry properties of partially sparse signal recovery ⋮ Compressed sensing of color images ⋮ Robustness of orthogonal matching pursuit under restricted isometry property ⋮ Analysis of orthogonal multi-matching pursuit under restricted isometry property ⋮ On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing ⋮ Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\) ⋮ A reweighted nuclear norm minimization algorithm for low rank matrix recovery ⋮ Restricted \(p\)-isometry property and its application for nonconvex compressive sensing ⋮ A sharp RIP condition for orthogonal matching pursuit ⋮ On support sizes of restricted isometry constants ⋮ Least Sparsity of $p$-Norm Based Optimization Problems with $p>1$ ⋮ Noise-Shaping Quantization Methods for Frame-Based and Compressive Sampling Systems ⋮ Nonconvex sorted \(\ell_1\) minimization for sparse approximation ⋮ CURVELET-WAVELET REGULARIZED SPLIT BREGMAN ITERATION FOR COMPRESSED SENSING ⋮ EXACT LOW-RANK MATRIX RECOVERY VIA NONCONVEX SCHATTEN p-MINIMIZATION ⋮ Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization ⋮ A new sufficient condition for sparse vector recovery via ℓ1 − ℓ2 local minimization ⋮ Optimal \(D\)-RIP bounds in compressed sensing

Uses Software

• PDCO

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&lt;tex&gt;$ell _1$&lt;/tex&gt;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 ℓ ¹ minimization
• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing