Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$

DOI10.1109/TIT.2009.2016030zbMath1367.94083MaRDI QIDQ4975849

Michael Evan Davies, Rémi Gribonval

Publication date: 8 August 2017

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

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items

The gap between the null space property and the restricted isometry property, Sparse data-driven quadrature rules via \(\ell^p\)-quasi-norm minimization, Sparse signal recovery via generalized Gaussian function, Block sparse recovery via mixed \(l_2/l_1\) minimization, A theoretical result of sparse signal recovery via alternating projection method, The bounds of restricted isometry constants for low rank matrices recovery, A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization, Relaxed sparse eigenvalue conditions for sparse estimation via non-convex regularized regression, The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing, Recovery of sparsest signals via \(\ell^q \)-minimization, Stability of lq-analysis based dual frame with Weibull matrices for 0 < q ≤ 1, The residual method for regularizing ill-posed problems, On sparse recovery algorithms in unions of orthonormal bases, Flavors of Compressive Sensing, New bounds on the restricted isometry constant \(\delta _{2k}\), Restricted \(p\)-isometry properties of partially sparse signal recovery, New bounds for RIC in compressed sensing, 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, A data-driven framework for sparsity-enhanced surrogates with arbitrary mutually dependent randomness, Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\), Stable recovery of low-dimensional cones in Hilbert spaces: one RIP to rule them all, The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty, Sharp RIP bound for sparse signal and low-rank matrix recovery, Improved bounds for restricted isometry constants, Sparse recovery by non-convex optimization - instance optimality, A note on guaranteed sparse recovery via \(\ell_1\)-minimization, Iterative re-weighted least squares algorithm for \(l_p\)-minimization with tight frame and \(0 < p \leq 1\), Spherical Designs and Nonconvex Minimization for Recovery of Sparse Signals on the Sphere, The sparsest solution of the union of finite polytopes via its nonconvex relaxation, A note on block-sparse signal recovery with coherent tight frames, New conditions on stable recovery of weighted sparse signals via weighted \(l_1\) minimization, Structured random measurements in signal processing, Stochastic Collocation Methods via Minimisation of the Transformed L₁-Penalty, A theoretical perspective of solving phaseless compressive sensing via its nonconvex relaxation, EXACT LOW-RANK MATRIX RECOVERY VIA NONCONVEX SCHATTEN p-MINIMIZATION, ℓ ₁ − αℓ ₂ minimization methods for signal and image reconstruction with impulsive noise removal, Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization, Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit, A new sufficient condition for sparse vector recovery via ℓ1 − ℓ2 local minimization, On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels, Optimal \(D\)-RIP bounds in compressed sensing