Sparse recovery by non-convex optimization - instance optimality
From MaRDI portal
(Redirected from Publication:984656)
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
Cites work
- scientific article; zbMATH DE number 1574600 (Why is no real title available?)
- scientific article; zbMATH DE number 722315 (Why is no real title available?)
- A simple proof of the restricted isometry property for random matrices
- A simple test to check the optimality of a sparse signal approximation
- Atomic Decomposition by Basis Pursuit
- Banach-Mazur distances and projections on p-convex spaces
- Compressed sensing
- Compressed sensing and best \(k\)-term approximation
- Decoding by Linear Programming
- Highly sparse representations from dictionaries are unique and independent of the sparseness measure
- Iteratively reweighted least squares minimization for sparse recovery
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Recovery of Short, Complex Linear Combinations Via<tex>$ell _1$</tex>Minimization
- Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
- Restricted isometry properties and nonconvex compressive sensing
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Stability and instance optimality for Gaussian measurements in compressed sensing
- Stable signal recovery from incomplete and inaccurate measurements
- The restricted isometry property and its implications for compressed sensing
- Uncertainty principles and ideal atomic decomposition
Cited in
(39)- A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization
- Nomonotone spectral gradient method for sparse recovery
- Convergence and stability of iteratively reweighted least squares for low-rank matrix 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
- 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
- A new sufficient condition for sparse vector recovery via \(\ell_1\)-\( \ell_2\) local minimization
- 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
- Sparse kernel regression with coefficient-based \(\ell_q\)-regularization
- On support sizes of restricted isometry constants
- The sampling complexity on nonconvex sparse phase retrieval problem
- 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
- Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays
- Phase transition and higher order analysis of \(L_q\) regularization under dependence
- Instance optimal decoding by thresholding in compressed sensing
- Perfect Recovery Conditions for Non-negative Sparse Modeling
- 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 class of null space conditions for sparse recovery via nonconvex, non-separable minimizations
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)
