On the coincidence of pure greedy and best \(m\)-term approximations

DOI10.1134/S0001434622010230OpenAlexW4213411997WikidataQ114075403 ScholiaQ114075403MaRDI QIDQ2113418

K. S. Vishnevetskiy

Publication date: 14 March 2022

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434622010230

zbMATH Keywords

Hilbert space\(m\)-term approximationgreedy approximationcoherence parameter

Mathematics Subject Classification ID

Numerical approximation and computational geometry (primarily algorithms) (65Dxx) Artificial intelligence (68Txx) Numerical analysis (65-XX) Approximations and expansions (41Axx)

Related Items (1)

Comparison of Purely Greedy and Orthogonal Greedy Algorithm

Cites Work

• Unnamed Item
• Rates of convex approximation in non-Hilbert spaces
• Some remarks on greedy algorithms
• Greedy Approximation
• Adaptive greedy approximations

This page was built for publication: On the coincidence of pure greedy and best \(m\)-term approximations