Two lower estimates in greedy approximation

DOI10.1007/s00365-003-0533-6zbMath1044.41010OpenAlexW2090479267MaRDI QIDQ1423641

E. D. Livshitz, Vladimir N. Temlyakov

Publication date: 7 March 2004

Published in: Constructive Approximation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00365-003-0533-6

Mathematics Subject Classification ID

Rate of convergence, degree of approximation (41A25)

Related Items (9)

Greedy algorithms for prediction ⋮ Results and questions on a nonlinear approximation approach for solving high-dimensional partial differential equations ⋮ Rescaled pure greedy algorithm for Hilbert and Banach spaces ⋮ Greedy expansions in Banach spaces ⋮ Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms ⋮ Greedy expansions in Hilbert spaces ⋮ Approximation and learning by greedy algorithms ⋮ On performance of greedy algorithms ⋮ Efficiency of the weak Rescaled Pure Greedy Algorithm

This page was built for publication: Two lower estimates in greedy approximation