Gradient Pursuits

DOI10.1109/TSP.2007.916124zbMath1390.94102MaRDI QIDQ4568731

Thomas Blumensath, Michael E. Davies

Publication date: 27 June 2018

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

Mathematics Subject Classification ID

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

Related Items

Unnamed Item, A New Computational Method for the Sparsest Solutions to Systems of Linear Equations, Sparse microwave imaging: principles and applications, Sparse conjugate directions pursuit with application to fixed-size kernel models, Greedy and randomized versions of the multiplicative Schwarz method, Regression analysis of locality preserving projections via sparse penalty, Convergence of fixed-point continuation algorithms for matrix rank minimization, Randomization of data acquisition and \(\ell_{1}\)-optimization (recognition with compression), Compressive wave computation, A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem, On a simple derivation of the complementary matching pursuit, Observable dictionary learning for high-dimensional statistical inference, Sparse signal recovery via ECME thresholding pursuits, Analysis of the self projected matching pursuit algorithm, A smoothing method for sparse optimization over convex sets, A sparse signal reconstruction method based on improved double chains quantum genetic algorithm, Duality gap estimates for weak Chebyshev greedy algorithms in Banach spaces, Greedy approximation in convex optimization, Iterative identification for multiple-input systems with time-delays based on greedy pursuit and auxiliary model, Newton method for \(\ell_0\)-regularized optimization