Stagewise Weak Gradient Pursuits

DOI10.1109/TSP.2009.2025088MaRDI QIDQ4569961zbMATH OpenOpenAlexFDO

Authors Thomas Blumensath, M. E. Davies

Publication date 9 July 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2009.2025088

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(10)

• The nonlocal sparse reconstruction algorithm by similarity measurement with shearlet feature vector
• Biorthogonal greedy algorithms in convex optimization
• Duality gap estimates for weak Chebyshev greedy algorithms in Banach spaces
• Greedy approximation in convex optimization
• Spatially-Dimension-Adaptive Sparse Grids for Online Learning
• Greedy and randomized versions of the multiplicative Schwarz method
• Cardinality minimization, constraints, and regularization: a survey
• From theoretical guarantee to practical performance: selectable and optimal step-lengths for IHT and HTP algorithms in compressed sensing
• On a class of greedy sparse recovery algorithms
• A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem

This page was built for publication: Stagewise Weak Gradient Pursuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4569961)