Recovery of sparsest signals via ^q -minimization

DOI10.1016/J.ACHA.2011.07.001MaRDI QIDQ413642zbMATH OpenOpenAlexFDO

Authors Qiyu Sun

Publication date 7 May 2012

Published in Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1005.0267

zbMATH Keywords

sparse signalcompressive sampling\(\ell^q \)-minimization

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)

Abstract: In this paper, it is proved that every $s$-sparse vector $$ can be exactly recovered from the measurement vector $$ via some $el{l}^q$-minimization with $0<qle1$, as soon as each $s$-sparse vector $$ is uniquely determined by the measurement $$.

Recommendations

• A note on guaranteed sparse recovery via \(\ell_1\)-minimization
• Stable recovery of sparse signals via \(\ell_p\)-minimization
• The restricted isometry property and its implications for compressed sensing
• Stable Recovery of Sparse Signals Via Regularized Minimization
• On exact recovery of sparse vectors from linear measurements

Cites work

• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• A note on guaranteed sparse recovery via \(\ell_1\)-minimization
• An affine scaling methodology for best basis selection
• Compressed sensing and best \(k\)-term approximation
• Decoding by Linear Programming
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Highly sparse representations from dictionaries are unique and independent of the sparseness measure
• Iteratively reweighted least squares minimization for sparse recovery
• Lower bound theory of nonzero entries in solutions of \(\ell_2-\ell_p\) minimization
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ 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
• Shifting Inequality and Recovery of Sparse Signals
• Sparse Approximate Solutions to Linear Systems
• Sparse recovery by non-convex optimization - instance optimality
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• Stable signal recovery from incomplete and inaccurate measurements
• The restricted isometry property and its implications for compressed sensing

Cited in

(79)

• Sparse recovery with coherent frames via \(\ell_{1-2}\)-analysis
• Stable recovery of sparse signals with coherent tight frames via \(l_p\)-analysis approach
• Matrix recovery from nonconvex regularized least absolute deviations
• k-Sparse Vector Recovery via $$\ell _1-\alpha \ell _2$$ Local Minimization
• Stable recovery of approximately block \(k\)-sparse signals with partial block support information via weighted \(\ell_2/\ell_p\) (\(0 < p \leq 1\)) minimization
• Sufficient conditions on stable reconstruction of weighted problem
• A new sufficient condition for sparse vector recovery via \(\ell_1\)-\( \ell_2\) local minimization
• Group sparse structural smoothing recovery: model, statistical properties and algorithm
• Robust Recovery of Jointly-Sparse Signals Using Minimax Concave Loss Function
• SPOQ $\ell _p$-Over-$\ell _q$ Regularization for Sparse Signal Recovery Applied to Mass Spectrometry
• What is the Largest Sparsity Pattern That Can Be Recovered by 1-Norm Minimization?
• An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model
• A bisection method for computing the proximal operator of the \(\ell_p\)-norm for any \(0 < p < 1\) with application to Schatten \(p\)-norms
• Minimax Optimal Sparse Signal Recovery With Poisson Statistics
• Note on sparsity in signal recovery and in matrix identification
• On the sign recovery by least absolute shrinkage and selection operator, thresholded least absolute shrinkage and selection operator, and thresholded basis pursuit denoising
• A wonderful triangle in compressed sensing
• scientific article; zbMATH DE number 7027997 (Why is no real title available?)
• Sparse signal recovery from quadratic measurements via convex programming
• Stable recovery of sparse signals via \(\ell_p\)-minimization
• \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization
• On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing
• A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization
• The gap between the null space property and the restricted isometry property
• On monotone and primal-dual active set schemes for \(\ell^p\)-type problems, \(p \in (0,1]\)
• On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
• The nonnegative zero-norm minimization under generalized \(Z\)-matrix measurement
• An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration
• A theoretical perspective of solving phaseless compressive sensing via its nonconvex relaxation
• Stable Recovery of Sparse Signals and an Oracle Inequality
• The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms
• A unified primal dual active set algorithm for nonconvex sparse recovery
• The Dantzig selector: recovery of signal via ℓ ₁ − αℓ ₂ minimization
• Improved RIP conditions for compressed sensing with coherent tight frames
• Sparse recovery with integrality constraints
• Letter to the editor: ``On exact recovery of sparse vectors from linear measurements
• Sparse recovery using the discrete cosine transform
• Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization
• Sparse Recovery of Nonnegative Signals With Minimal Expansion
• Non-convex compressed sensing with the sum-of-squares method
• A simple Gaussian measurement bound for exact recovery of block-sparse signals
• Stable recovery of low-rank matrix via nonconvex Schatten \(p\)-minimization
• Spark-level sparsity and the \(\ell_1\) tail minimization
• Global optimality condition and fixed point continuation algorithm for non-Lipschitz \(\ell_p\) regularized matrix minimization
• Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
• Exact Recoverability From Dense Corrupted Observations via $\ell _{1}$-Minimization
• An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices
• The null space property for sparse recovery from multiple measurement vectors
• Weak stability of \(\ell_1\)-minimization methods in sparse data reconstruction
• \(\ell_1-\alpha\ell_2\) minimization methods for signal and image reconstruction with impulsive noise removal
• Bound alternative direction optimization for image deblurring
• On a monotone scheme for nonconvex nonsmooth optimization with applications to fracture mechanics
• Nonlinear frames and sparse reconstructions in Banach spaces
• Non-Lipschitz models for image restoration with impulse noise removal
• Spherical designs and nonconvex minimization for recovery of sparse signals on the sphere
• Concentration of \(S\)-largest mutilated vectors with \(\ell_p\)-quasinorm for \(0<p\leq 1\) and its applications
• Stable recovery of weighted sparse signals from phaseless measurements via weighted l₁ minimization
• Sparsest representations and approximations of an underdetermined linear system
• A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron
• Sparse Signal Reconstruction from Quantized Noisy Measurements via GEM Hard Thresholding
• The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing
• A numerical exploration of compressed sampling recovery
• Sparse Recovery of Streaming Signals Using <formula formulatype="inline"><tex Notation="TeX">$\ell_1$</tex></formula>-Homotopy
• Stable Recovery of Sparse Signals Via Regularized Minimization
• Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\)
• Affine matrix rank minimization problem via non-convex fraction function penalty
• Entropy function-based algorithms for solving a class of nonconvex minimization problems
• Sparse Recovery via ℓ_q-Minimization for Polynomial Chaos Expansions
• Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization
• The sparsest solution of the union of finite polytopes via its nonconvex relaxation
• The sparsity of underdetermined linear system via \(l_p\) minimization for \(0 < p < 1\)
• Stability of 1-bit compressed sensing in sparse data reconstruction
• A sharp recovery condition for block sparse signals by block orthogonal multi-matching pursuit
• New conditions on stable recovery of weighted sparse signals via weighted \(l_1\) minimization
• Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\)
• Exact recovery of sparse multiple measurement vectors by \(l_{2,p}\)-minimization
• A note on guaranteed sparse recovery via \(\ell_1\)-minimization
• Recovery of Short, Complex Linear Combinations Via&lt;tex&gt;$ell _1$&lt;/tex&gt;Minimization
• On the Schatten \(p\)-quasi-norm minimization for low-rank matrix recovery

This page was built for publication: Recovery of sparsest signals via \(\ell^q \)-minimization

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