Fast Implementation of ℓ 1-Greedy Algorithm

DOI10.1007/978-1-4614-4565-4_25zbMath1271.65062OpenAlexW241367661MaRDI QIDQ2840660

No author found.

Publication date: 23 July 2013

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-4565-4_25

zbMATH Keywords

computational complexitynumerical examplessparse solution\(\ell^1\)-minimization\(\ell^1\)-greedy strategyinterior-point linear programming algorithm

Mathematics Subject Classification ID

Interior-point methods (90C51) Iterative numerical methods for linear systems (65F10) Complexity and performance of numerical algorithms (65Y20)

Related Items

Error analysis of reweighted \(l_1\) greedy algorithm for noisy reconstruction

Cites Work

• Unnamed Item
• Unnamed Item
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• Fast implementation of orthogonal greedy algorithm for tight wavelet frames
• An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
• Sparse Solutions of Underdetermined Linear Systems
• Decoding by Linear Programming
• Iteratively reweighted least squares minimization for sparse recovery
• Sparse Approximate Solutions to Linear Systems
• Compressed sensing