Phase transitions for greedy sparse approximation algorithms
From MaRDI portal
Publication:629259
DOI10.1016/j.acha.2010.07.001zbMath1229.94003arXiv1004.1821OpenAlexW2150386037MaRDI QIDQ629259
Jared Tanner, Jeffrey D. Blanchard, Andrew Thompson, Coralia Cartis
Publication date: 9 March 2011
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1004.1821
phase transitionsgreedy algorithmscompressed sensingrestricted isometry propertyGaussian matricessparse solutions to underdetermined systems
Related Items
The gap between the null space property and the restricted isometry property, Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity, Performance comparisons of greedy algorithms in compressed sensing, Phase transitions for greedy sparse approximation algorithms, CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion, Compressive Sensing, Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices, The restricted isometry property for random block diagonal matrices, On support sizes of restricted isometry constants, Quasi-linear Compressed Sensing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding the stationary states of Markov chains by iterative methods
- Phase transitions for greedy sparse approximation algorithms
- On support sizes of restricted isometry constants
- Iterative hard thresholding for compressed sensing
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- Introductory lectures on convex optimization. A basic course.
- High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
- Counting faces of randomly projected polytopes when the projection radically lowers dimension
- Improved Bounds on Restricted Isometry Constants for Gaussian Matrices
- Compressed Sensing: How Sharp Is the Restricted Isometry Property?
- On sparse reconstruction from Fourier and Gaussian measurements
- Decoding by Linear Programming
- Probing the Pareto Frontier for Basis Pursuit Solutions
- Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Sparse Approximate Solutions to Linear Systems
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Compressed sensing
