Gradient Pursuits
From MaRDI portal
Publication:4568731
DOI10.1109/TSP.2007.916124zbMath1390.94102OpenAlexW2293318283MaRDI QIDQ4568731
Thomas Blumensath, Michael E. Davies
Publication date: 27 June 2018
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tsp.2007.916124
Related Items
Observable dictionary learning for high-dimensional statistical inference, Biorthogonal greedy algorithms in convex optimization, Gradient projection Newton pursuit for sparsity constrained optimization, Sparse microwave imaging: principles and applications, Newton method for \(\ell_0\)-regularized optimization, A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem, A smoothing method for sparse optimization over convex sets, Iterative identification for multiple-input systems with time-delays based on greedy pursuit and auxiliary model, Unnamed Item, Sparse conjugate directions pursuit with application to fixed-size kernel models, Sparse signal recovery via ECME thresholding pursuits, 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, Analysis of the self projected matching pursuit algorithm, Randomization of data acquisition and \(\ell_{1}\)-optimization (recognition with compression), Compressive wave computation, On a simple derivation of the complementary matching pursuit, A sparse signal reconstruction method based on improved double chains quantum genetic algorithm, A Lagrange-Newton algorithm for sparse nonlinear programming, Duality gap estimates for weak Chebyshev greedy algorithms in Banach spaces, A New Computational Method for the Sparsest Solutions to Systems of Linear Equations, Greedy approximation in convex optimization
