On the Gap Between Restricted Isometry Properties and Sparse Recovery Conditions

DOI10.1109/TIT.2016.2570244MaRDI QIDQ4682855zbMATH OpenOpenAlexFDO

Authors Sjoerd Dirksen, Guillaume Lecué, Holger Rauhut

Publication date 19 September 2018

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2016.2570244

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Ridge regression; shrinkage estimators (Lasso) (62J07) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants
• Restricted \(p\)-isometry properties of partially sparse signal recovery
• Generalized notions of sparsity and restricted isometry property. I: A unified framework
• The restricted isometry property and its implications for compressed sensing
• A generalization of the restricted isometry property and applications to compressed sensing
• Generalized notions of sparsity and restricted isometry property. II: Applications
• Restricted isometry properties and nonconvex compressive sensing
• Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
• The gap between the null space property and the restricted isometry property
• Sparse Recovery Conditions and Performance Bounds for $\ell _p$-Minimization

Cited in

(18)

• Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs
• Non-Gaussian hyperplane tessellations and robust one-bit compressed sensing
• Compressed sensing in the spherical near-field to far-field transformation
• The restricted isometry property of block diagonal matrices for group-sparse signal recovery
• Signal separation under coherent dictionaries and _p-bounded noise
• Complex phase retrieval from subgaussian measurements
• Conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery
• An introduction to compressed sensing
• Quantized compressed sensing: a survey
• Regularization and the small-ball method. II: Complexity dependent error rates
• Low-Rank Matrix Estimation from Rank-One Projections by Unlifted Convex Optimization
• On the geometry of polytopes generated by heavy-tailed random vectors
• The trimmed Lasso: sparse recovery guarantees and practical optimization by the generalized soft-min penalty
• Stable and robust $\ell_p$-constrained compressive sensing recovery via robust width property
• High-order block RIP for nonconvex block-sparse compressed sensing
• Robust sparse recovery with sparse Bernoulli matrices via expanders
• New conditions on robust and stable recovery of non-strictly k-ranked matrices via Schatten p-norm minimization
• Preserving injectivity under subgaussian mappings and its application to compressed sensing

This page was built for publication: On the Gap Between Restricted Isometry Properties and Sparse Recovery Conditions

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