Stable recovery of low-dimensional cones in Hilbert spaces: one RIP to rule them all
From MaRDI portal
Publication:1748256
DOI10.1016/j.acha.2016.08.004zbMath1391.94421arXiv1510.00504OpenAlexW2962684767MaRDI QIDQ1748256
Rémi Gribonval, Yann Traonmilin
Publication date: 9 May 2018
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.00504
Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)
Related Items
Convergence bounds for empirical nonlinear least-squares, WARPd: A Linearly Convergent First-Order Primal-Dual Algorithm for Inverse Problems with Approximate Sharpness Conditions, Generalized notions of sparsity and restricted isometry property. II: Applications, Statistical learning guarantees for compressive clustering and compressive mixture modeling, Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class, Optimal approximation of infinite-dimensional holomorphic functions, Do log factors matter? On optimal wavelet approximation and the foundations of compressed sensing, BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING, Uniform recovery in infinite-dimensional compressed sensing and applications to structured binary sampling, Structure and Optimisation in Computational Harmonic Analysis: On Key Aspects in Sparse Regularisation, Sparse recovery from extreme eigenvalues deviation inequalities, Structured iterative hard thresholding with on- and off-grid applications, Recovering Wavelet Coefficients from Binary Samples Using Fast Transforms, On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels, Hierarchical isometry properties of hierarchical measurements
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A mathematical introduction to compressive sensing
- Compressed sensing with coherent and redundant dictionaries
- A generalized sampling theorem for stable reconstructions in arbitrary bases
- The restricted isometry property and its implications for compressed sensing
- The convex geometry of linear inverse problems
- Stable restoration and separation of approximately sparse signals
- New analysis of manifold embeddings and signal recovery from compressive measurements
- Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
- Robust multi-image processing with optimal sparse regularization
- Beyond Consistent Reconstructions: Optimality and Sharp Bounds for Generalized Sampling, and Application to the Uniform Resampling Problem
- BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING
- Fundamental Performance Limits for Ideal Decoders in High-Dimensional Linear Inverse Problems
- Extensions of Lipschitz mappings into a Hilbert space
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- A GENERAL ATOMIC DECOMPOSITION THEOREM AND BANACH'S CLOSED RANGE THEOREM
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Robust Recovery of Signals From a Structured Union of Subspaces
- Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces
- Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
- Living on the edge: phase transitions in convex programs with random data
- Sampling and Reconstructing Signals From a Union of Linear Subspaces
- Model-Based Compressive Sensing
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Model Selection and Estimation in Regression with Grouped Variables
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
