A criterion for convergence of weak greedy algorithms
From MaRDI portal
Publication:1610211
DOI10.1023/A:1016061804993zbMath1128.41309OpenAlexW20244218MaRDI QIDQ1610211
Publication date: 19 August 2002
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1016061804993
Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Interpolation in approximation theory (41A05) Rate of convergence, degree of approximation (41A25)
Related Items (7)
Greedy expansions in Banach spaces ⋮ Convergence of the weak dual greedy algorithm in \(L_{p}\)-spaces. ⋮ Vector greedy algorithms ⋮ On \(n\)-term approximation with positive coefficients ⋮ Simultaneous approximation by greedy algorithms ⋮ A solution for the greedy approximation of a step function with a waveform dictionary ⋮ Generalized approximate weak greedy algorithms
This page was built for publication: A criterion for convergence of weak greedy algorithms
