Sparse recovery by non-convex optimization - instance optimality

DOI10.1016/J.ACHA.2009.08.002zbMATH Open1200.90158OpenAlexW2072327470MaRDI QIDQ984656FDOQ984656

Authors: Rayan Saab, Özgür Yılmaz 

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

Recommendations

• Restricted \(p\)-isometry property and its application for nonconvex compressive sensing
• Restricted isometry properties and nonconvex compressive sensing
• Sparse signal recovery via non-convex optimization and overcomplete dictionaries
• Stable recovery of sparse signals via \(\ell_p\)-minimization
• Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization

zbMATH Keywords

compressed sensingsparse reconstructioncompressive samplinginstance optimality\(\ell ^{1}\) minimization\(\ell ^p\) minimizationinstance optimality in probability

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Atomic Decomposition by Basis Pursuit
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Decoding by Linear Programming
• Stable signal recovery from incomplete and inaccurate measurements
• A simple proof of the restricted isometry property for random matrices
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Compressed sensing
• Compressed sensing and best \(k\)-term approximation
• Uncertainty principles and ideal atomic decomposition
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• Restricted isometry properties and nonconvex compressive sensing
• Iteratively reweighted least squares minimization for sparse recovery
• Recovery of Short, Complex Linear Combinations Via&lt;tex&gt;$ell _1$&lt;/tex&gt;Minimization
• Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
• The restricted isometry property and its implications for compressed sensing
• Stability and instance optimality for Gaussian measurements in compressed sensing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Highly sparse representations from dictionaries are unique and independent of the sparseness measure
• A simple test to check the optimality of a sparse signal approximation
• Banach-Mazur distances and projections on p-convex spaces

Cited In (38)

• A new sufficient condition for sparse vector recovery via ℓ1 − ℓ2 local minimization
• Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery
• Nomonotone spectral gradient method for sparse recovery
• Compressed sensing of color images
• Recovery of sparsest signals via \(\ell^q \)-minimization
• Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum
• Nonconvex sorted \(\ell_1\) minimization for sparse approximation
• Title not available (Why is that?)
• Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\)
• Least sparsity of \(p\)-norm based optimization problems with \(p>1\)
• Stability of \(l_q\)-analysis based dual frame with Weibull matrices for \(0<q\leq 1\)
• Compressed sensing recovery via nonconvex shrinkage penalties
• Analysis of orthogonal multi-matching pursuit under restricted isometry property
• Robustness of orthogonal matching pursuit under restricted isometry property
• Instance-optimality in probability with an \(\ell _1\)-minimization decoder
• Perturbations of measurement matrices and dictionaries in compressed sensing
• Noise-shaping quantization methods for frame-based and compressive sampling systems
• Optimal \(D\)-RIP bounds in compressed sensing
• Quantization of compressive samples with stable and robust recovery
• A unified primal dual active set algorithm for nonconvex sparse recovery
• A reweighted nuclear norm minimization algorithm for low rank matrix recovery
• Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization
• Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing
• The sampling complexity on nonconvex sparse phase retrieval problem
• On support sizes of restricted isometry constants
• Exact low-rank matrix recovery via nonconvex Schatten \(p\)-minimization
• Curvelet-wavelet regularized split Bregman iteration for compressed sensing
• On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing
• Restricted \(p\)-isometry properties of partially sparse signal recovery
• Phase transition and higher order analysis of \(L_q\) regularization under dependence
• Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays
• Perfect Recovery Conditions for Non-negative Sparse Modeling
• Instance optimal decoding by thresholding in compressed sensing
• Restricted \(p\)-isometry property and its application for nonconvex compressive sensing
• Optimal computational and statistical rates of convergence for sparse nonconvex learning problems
• Sparse signal recovery via non-convex optimization and overcomplete dictionaries
• A sharp RIP condition for orthogonal matching pursuit
• A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization

Uses Software

• PDCO

This page was built for publication: Sparse recovery by non-convex optimization - instance optimality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q984656)