New bounds on the restricted isometry constant \(\delta _{2k}\)
From MaRDI portal
Publication:643651
DOI10.1016/j.acha.2011.04.005zbMath1231.94027OpenAlexW1484715564MaRDI QIDQ643651
Publication date: 2 November 2011
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.acha.2011.04.005
Applications of mathematical programming (90C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)
Related Items (44)
Stable recovery of low-rank matrix via nonconvex Schatten \(p\)-minimization ⋮ A general theory for subspace-sparse recovery ⋮ THE RESTRICTED ISOMETRY PROPERTY FOR SIGNAL RECOVERY WITH COHERENT TIGHT FRAMES ⋮ A survey on compressive sensing: classical results and recent advancements ⋮ A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions ⋮ Block sparse recovery via mixed \(l_2/l_1\) minimization ⋮ Suprema of Chaos Processes and the Restricted Isometry Property ⋮ A new bound on the block restricted isometry constant in compressed sensing ⋮ The bounds of restricted isometry constants for low rank matrices recovery ⋮ Recovery analysis for block ℓp − ℓ1 minimization with prior support information ⋮ Robust signal recovery via \(\ell_{1-2}/ \ell_p\) minimization with partially known support ⋮ Unnamed Item ⋮ Stable recovery of weighted sparse signals from phaseless measurements via weighted l1 minimization ⋮ Sparse Legendre expansions via \(\ell_1\)-minimization ⋮ Modewise operators, the tensor restricted isometry property, and low-rank tensor recovery ⋮ \(k\)-sparse vector recovery via truncated \(\ell_1 -\ell_2\) local minimization ⋮ Weighted ${\ell}_{{1}}$-minimization for sparse recovery under arbitrary prior information ⋮ A null-space-based weightedl1minimization approach to compressed sensing ⋮ Stability and robustness of \(\ell_1\)-minimizations with Weibull matrices and redundant dictionaries ⋮ Greedy-like algorithms for the cosparse analysis model ⋮ Recovery of signals under the condition on RIC and ROC via prior support information ⋮ New bounds for RIC in compressed sensing ⋮ Stability analysis of a class of sparse optimization problems ⋮ Stable recovery of sparse signals via \(\ell_p\)-minimization ⋮ Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\) ⋮ 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\) ⋮ Sharp RIP bound for sparse signal and low-rank matrix recovery ⋮ Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO ⋮ Compressed data separation via dual frames based split-analysis with Weibull matrices ⋮ Weak Stability of ℓ1-Minimization Methods in Sparse Data Reconstruction ⋮ New conditions on stable recovery of weighted sparse signals via weighted \(l_1\) minimization ⋮ Asymptotic analysis for extreme eigenvalues of principal minors of random matrices ⋮ Robust sparse recovery via a novel convex model ⋮ SPARSE RECONSTRUCTION OF HARDY SIGNAL AND APPLICATIONS TO TIME-FREQUENCY DISTRIBUTION ⋮ One-bit compressed sensing via ℓ p (0 < p < 1)-minimization method ⋮ Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization ⋮ Robust signal recovery for ℓ 1–2 minimization via prior support information ⋮ Stable recovery of low rank matrices from nuclear norm minimization ⋮ A new sufficient condition for sparse vector recovery via ℓ1 − ℓ2 local minimization ⋮ An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization ⋮ Stable recovery of sparse signals with coherent tight frames via lp-analysis approach ⋮ Optimal \(D\)-RIP bounds in compressed sensing ⋮ Weighted \(\ell_p\) (\(0<p\le 1\)) minimization with non-uniform weights for sparse recovery under partial support information
Cites Work
- The restricted isometry property and its implications for compressed sensing
- A note on guaranteed sparse recovery via \(\ell_1\)-minimization
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Decoding by Linear Programming
- Shifting Inequality and Recovery of Sparse Signals
- Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
- New Bounds for Restricted Isometry Constants
This page was built for publication: New bounds on the restricted isometry constant \(\delta _{2k}\)