GPU accelerated greedy algorithms for compressed sensing
From MaRDI portal
Publication:744210
DOI10.1007/s12532-013-0056-5zbMath1300.65038OpenAlexW2116953231MaRDI QIDQ744210
Jeffrey D. Blanchard, Jared Tanner
Publication date: 6 October 2014
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-013-0056-5
combinatorial optimizationparallel computingsparse approximationgreedy algorithmscompressed sensinggraphics processing unitscosampHTPIHTNIHTsubspace pursuit
Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Parallel numerical computation (65Y05)
Related Items
Expander \(\ell_0\)-decoding, Performance comparisons of greedy algorithms in compressed sensing, CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion, GPU accelerated greedy algorithms for compressed sensing
Uses Software
Cites Work
- Unnamed Item
- Iterative hard thresholding for compressed sensing
- GPU accelerated greedy algorithms for compressed sensing
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Selection by distributive partitioning
- Matrix recipes for hard thresholding methods
- High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
- Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
- Decoding by Linear Programming
- Greed is Good: Algorithmic Results for Sparse Approximation
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Probing the Pareto Frontier for Basis Pursuit Solutions
- Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
- Sparse Reconstruction by Separable Approximation
- Sparse Approximate Solutions to Linear Systems
- Matching pursuits with time-frequency dictionaries
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Fast <it>k</it>-selection algorithms for graphics processing units
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- For most large underdetermined systems of equations, the minimal 𝓁1‐norm near‐solution approximates the sparsest near‐solution
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
