Compressed Sensing: How Sharp Is the Restricted Isometry Property?

From MaRDI portal
Publication:3084491

DOI10.1137/090748160zbMath1214.41008arXiv1004.5026OpenAlexW2018429487MaRDI QIDQ3084491

Coralia Cartis, Jared Tanner, Jeffrey D. Blanchard

Publication date: 25 March 2011

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1004.5026



Related Items

An Unbiased Approach to Low Rank Recovery, Testable uniqueness conditions for empirical assessment of undersampling levels in total variation-regularized X-ray CT, Bias versus non-convexity in compressed sensing, Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations, A provably convergent scheme for compressive sensing under random generative priors, Performance comparisons of greedy algorithms in compressed sensing, Sparse total least squares: analysis and greedy algorithms, Debiasing convex regularized estimators and interval estimation in linear models, Phase transitions for greedy sparse approximation algorithms, CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion, A null-space-based weightedl1minimization approach to compressed sensing, Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices, On the sparsity of Lasso minimizers in sparse data recovery, An unbiased approach to compressed sensing, Sparse regression and support recovery with \(\mathbb{L}_2\)-boosting algorithms, The restricted isometry property for random block diagonal matrices, Discrete uncertainty principles and sparse signal processing, On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery, The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty, A numerical exploration of compressed sampling recovery, On support sizes of restricted isometry constants, Matrix-free interior point method for compressed sensing problems, Sparse recovery from extreme eigenvalues deviation inequalities, Theoretical guarantees for graph sparse coding, LASSO risk and phase transition under dependence, Robust Width: A Characterization of Uniformly Stable and Robust Compressed Sensing, Optimal \(D\)-RIP bounds in compressed sensing, On edge connectivity and parity factor


Uses Software