Greedy algorithms: a review and open problems

DOI10.1186/S13660-025-03254-1MaRDI QIDQ6940653zbMATH OpenFDO

Authors Andrea García

Publication date 19 August 2025

Published in Journal of Inequalities and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1186/S13660-025-03254-1

zbMATH Keywords

greedy algorithmgreedy bases

Mathematics Subject Classification ID

Approximation by arbitrary nonlinear expressions; widths and entropy (41A46) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Summability and bases; functional analytic aspects of frames in Banach and Hilbert spaces (46B15)

Cites work

• A note on 1-semi-greedy bases in \(p\)-Banach spaces with \(0 < P \leq 1\)
• A note on partially-greedy bases in quasi-Banach spaces
• A remark on greedy approximation in Banach spaces.
• Characterization of 1-almost greedy bases
• Characterization of 1-greedy bases
• Convergence of greedy approximation I. General systems
• Embeddings and Lebesgue-type inequalities for the greedy algorithm in Banach spaces
• Equivalence between almost-greedy and semi-greedy bases
• Greedy algorithm for general biorthogonal systems
• Greedy algorithm with gaps
• Greedy approximation
• Greedy approximation for biorthogonal systems in quasi-Banach spaces
• scientific article; zbMATH DE number 3129734 (Why is no real title available?)
• scientific article; zbMATH DE number 1959425 (Why is no real title available?)
• scientific article; zbMATH DE number 2016952 (Why is no real title available?)
• scientific article; zbMATH DE number 7537978 (Why is no real title available?)
• Locally bounded linear topological spaces
• On approximation spaces and Greedy-type bases
• On the existence of almost greedy bases in Banach spaces
• Performance comparisons of greedy algorithms in compressed sensing.
• Quasi-greedy bases for sequences with gaps
• Renorming spaces with greedy bases
• Some remarks on greedy algorithms
• Sparse approximation and recovery by greedy algorithms in Banach spaces
• The thresholding greedy algorithm, greedy bases, and duality
• Weak greedy algorithms and the equivalence between semi-greedy and almost greedy Markushevich bases

Cited in

(1)

• Target layer state estimation in multilayer complex dynamical networks considering multidimensional node dynamics

This page was built for publication: Greedy algorithms: a review and open problems

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