Performance comparisons of greedy algorithms in compressed sensing.
DOI10.1002/NLA.1948zbMATH Open1363.94017OpenAlexW2161208647MaRDI QIDQ2948099FDOQ2948099
Authors: Jeffrey D. Blanchard, Jared Tanner 
Publication date: 29 September 2015
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.1948
Recommendations
Applications of mathematical programming (90C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical algorithms for specific classes of architectures (65Y10)
Cites Work
- Probing the Pareto frontier for basis pursuit solutions
- Decoding by Linear Programming
- Methods of conjugate gradients for solving linear systems
- Compressed sensing
- Sparse Reconstruction by Separable Approximation
- Iterative hard thresholding for compressed sensing
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
- Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
- Precise Stability Phase Transitions for $\ell_1$ Minimization: A Unified Geometric Framework
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Neighborliness of randomly projected simplices in high dimensions
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
- Phase transitions for greedy sparse approximation algorithms
- A New and Improved Quantitative Recovery Analysis for Iterative Hard Thresholding Algorithms in Compressed Sensing
- Counting faces of randomly projected polytopes when the projection radically lowers dimension
- Counting the faces of randomly-projected hypercubes and orthants, with applications
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Accurate Prediction of Phase Transitions in Compressed Sensing via a Connection to Minimax Denoising
- The Noise-Sensitivity Phase Transition in Compressed Sensing
- Hard thresholding pursuit: an algorithm for compressive sensing
- Null space conditions and thresholds for rank minimization
- Compressed sensing: how sharp is the restricted isometry property?
- GPU accelerated greedy algorithms for compressed sensing
Cited In (15)
- Approximately normalized iterative hard thresholding for nonlinear compressive sensing
- Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems
- Heavy-ball-based hard thresholding algorithms for sparse signal recovery
- A tight bound of hard thresholding
- GPU accelerated greedy algorithms for compressed sensing
- Data-driven algorithm selection and tuning in optimization and signal processing
- Non-negative sparse recovery via momentum-boosted adaptive thresholding algorithm
- Expander \(\ell_0\)-decoding
- On rank awareness, thresholding, and MUSIC for joint sparse recovery
- The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing
- Generalizing CoSaMP to signals from a union of low dimensional linear subspaces
- Sparse signal recovery via ECME thresholding pursuits
- Compressed sensing of low-rank plus sparse matrices
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
Uses Software
This page was built for publication: Performance comparisons of greedy algorithms in compressed sensing.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948099)
