Optimal RIP bounds for sparse signals recovery via _p minimization

DOI10.1016/J.ACHA.2017.10.004MaRDI QIDQ2330928zbMATH OpenOpenAlexFDO

Authors Rui Zhang, Song Li

Publication date 23 October 2019

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

Full work available at URL https://doi.org/10.1016/j.acha.2017.10.004

zbMATH Keywords

\(\ell_p\) minimizationcompressed sensinglow-rank matrix recoveryoptimal restricted isometry propertytight frame

Mathematics Subject Classification ID

Random matrices (algebraic aspects) (15B52) Multidimensional problems (41A63) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Information theory (general) (94A15)

Recommendations

• Stable recovery of sparse signals via \(\ell_p\)-minimization
• Sharp RIP bound for sparse signal and low-rank matrix recovery
• Stable recovery of sparse signals with coherent tight frames via l_p-analysis approach
• scientific article; zbMATH DE number 7027997
• Optimal D-RIP bounds in compressed sensing

Cites work

• A mathematical introduction to compressive sensing
• A note on guaranteed sparse recovery via \(\ell_1\)-minimization
• A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery
• A simple proof of the restricted isometry property for random matrices
• Compressed sensing with coherent and redundant dictionaries
• Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\)
• Compressed Sensing With General Frames via Optimal-Dual-Based $\ell _{1}$-Analysis
• Decoding by Linear Programming
• Exact minimum rank approximation via Schatten p-norm minimization
• Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
• Improved iteratively reweighted least squares for unconstrained smoothed _q minimization
• Iteratively reweighted least squares minimization for sparse recovery
• New Bounds for Restricted Isometry Constants With Coherent Tight Frames
• New bounds on the restricted isometry constant \(\delta _{2k}\)
• Optimal D-RIP bounds in compressed sensing
• Perturbations of measurement matrices and dictionaries in compressed sensing
• Recovery of sparsest signals via \(\ell^q \)-minimization
• Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
• Restricted isometry properties and nonconvex compressive sensing
• Sharp RIP bound for sparse signal and low-rank matrix recovery
• Sparse recovery by non-convex optimization - instance optimality
• Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• Stable recovery of sparse overcomplete representations in the presence of noise
• Stable recovery of sparse signals via \(\ell_p\)-minimization
• Stable signal recovery from incomplete and inaccurate measurements
• The bounds of restricted isometry constants for low rank matrices recovery
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• The Improved Bounds of Restricted Isometry Constant for Recovery via <formula formulatype="inline"><tex Notation="TeX">$\ell_{p}$</tex> </formula>-Minimization
• The restricted isometry property and its implications for compressed sensing
• Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements

Cited in

(44)

• Low-rank matrix recovery via regularized nuclear norm minimization
• Weighted \(\ell_p\) (\(0<p\le 1\)) minimization with non-uniform weights for sparse recovery under partial support information
• Analysis non-sparse recovery for relaxed ALASSO
• Sharp RIP bound for sparse signal and low-rank matrix recovery
• Concentration of \(S\)-largest mutilated vectors with \(\ell_p\)-quasinorm for \(0<p\leq 1\) and its applications
• On the Schatten \(p\)-quasi-norm minimization for low-rank matrix recovery
• A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization
• The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing
• On sparse recovery algorithms in unions of orthonormal bases
• An Improved RIP-Based Performance Guarantee for Sparse Signal Recovery via Orthogonal Matching Pursuit
• _1-_2 minimization methods for signal and image reconstruction with impulsive noise removal
• The Dantzig selector: recovery of signal via ℓ ₁ − αℓ ₂ minimization
• A new sufficient condition for sparse vector recovery via _1- _2 local minimization
• Sparse phase retrieval via ℓp (0 < p ≤ 1) minimization
• Random sampling and reconstruction of sparse time- and band-limited signals
• Stable image reconstruction using transformed total variation minimization
• Robust recovery of a kind of weighted l1-minimization without noise level
• Robust recovery of signals with partially known support information using weighted BPDN
• Stable recovery of sparse signals with coherent tight frames via l_p-analysis approach
• New restricted isometry property analysis for \(\ell_1-\ell_2\) minimization methods
• Weighted _p-minimization for sparse signal recovery under arbitrary support prior
• An analysis of noise folding for low-rank matrix recovery
• The null space property of the weighted ℓr − ℓ1 minimization
• \(\boldsymbol{L_1-\beta L_q}\) Minimization for Signal and Image Recovery
• Nonconvex _p-_q minimization method and p-RIP condition for stable recovery of approximately k-sparse signals
• k-sparse vector recovery via truncated _1 -_2 local minimization
• Stable Recovery of Sparsely Corrupted Signals Through Justice Pursuit De-Noising
• k-Sparse Vector Recovery via $$\ell _1-\alpha \ell _2$$ Local Minimization
• Estimation of q for $\ell _{q}$-minimization in signal recovery with tight frame
• Matrix recovery from nonconvex regularized least absolute deviations
• Uniform RIP analysis for the _p- _q minimization
• High-order block RIP for nonconvex block-sparse compressed sensing
• Sparse recovery with coherent frames via \(\ell_{1-2}\)-analysis
• Compressed data separation via \(\ell_q\)-split analysis with \(\ell_\infty\)-constraint
• k block sparse vector recovery via block _1-_2 minimization
• Compressed data separation under _p bounded noise
• New conditions on robust and stable recovery of non-strictly k-ranked matrices via Schatten p-norm minimization
• Letter to the editor. Instance optimality in phase retrieval
• Uniform RIP bounds for recovery of signals with partial support information by weighted _p-minimization
• Stable recovery of sparse signals with non-convex weighted r-norm minus 1-norm
• Recovery analysis for the _p/_1 minimization problem
• A new framework for compressed sensing by p-concave functions
• Compressed data separation via _1 - _q-split analysis
• Sparse recovery by non-convex optimization - instance optimality

This page was built for publication: Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization

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