On support sizes of restricted isometry constants

DOI10.1016/J.ACHA.2010.05.001zbMATH Open1197.94027OpenAlexW2164717810MaRDI QIDQ711053FDOQ711053

Authors: Jeffrey D. Blanchard, Andrew Thompson 

Publication date: 25 October 2010

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

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

Recommendations

• On model-based RIP-1 matrices
• Compressed sensing: how sharp is the restricted isometry property?
• Restricted isometry property for general \(p\)-norms
• Sharp RIP bound for sparse signal and low-rank matrix recovery
• Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants

zbMATH Keywords

sparse approximationcompressed sensingrestricted isometry propertysparse signal recoveryrestricted isometry constants

Mathematics Subject Classification ID

Linear programming (90C05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Decoding (94B35)

Cites Work

• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Compressive sampling
• Decoding by Linear Programming
• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing
• Iterative hard thresholding for compressed sensing
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Sparse nonnegative solution of underdetermined linear equations by linear programming
• Sparse recovery by non-convex optimization - instance optimality
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
• Phase transitions for greedy sparse approximation algorithms
• The restricted isometry property and its implications for compressed sensing
• Shifting Inequality and Recovery of Sparse Signals
• New Bounds for Restricted Isometry Constants
• Compressed sensing: how sharp is the restricted isometry property?
• A note on guaranteed sparse recovery via \(\ell_1\)-minimization
• Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
• For most large underdetermined systems of equations, the minimal 𝓁₁‐norm near‐solution approximates the sparsest near‐solution

Cited In (5)

• Performance analysis for unconstrained analysis based approaches*
• Phase transitions for greedy sparse approximation algorithms
• A null-space-based weightedl₁minimization approach to compressed sensing
• The Dantzig selector: recovery of signal via ℓ ₁ − αℓ ₂ minimization
• New conditions on stable recovery of weighted sparse signals via weighted \(l_1\) minimization

Uses Software

• CoSaMP

This page was built for publication: On support sizes of restricted isometry constants

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