Abstract
This paper is devoted to the study of the rate of convergence of pure greedy algorithms in Hilbert space. We obtain upper bounds for the rate of convergence of pure greedy algorithms for functions from the class A α, β(D).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
L. K. Jones, "On a conjecture of Huber concerning the convergence of PP-regression," Ann. Statist., 15 (1987), 880–882.
R. A. DeVore and V. N. Temlyakov, "Some remarks on greedy algorithms," Adv. Comput. Math., 5 (1996), 173–187.
S. V. Konyagin and V. N. Temlyakov, "Rate of convergence of pure greedy algorithms," East J. Approx.,5 (1999), 493–499.
E. D. Livshitz and V. N. Temlyakov, "Two lower estimates in greedy approximation," Constructive Approximation, 19 (2003), 509–524.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Livshits, E.D. Rate of Convergence of Pure Greedy Algorithms. Mathematical Notes 76, 497–510 (2004). https://doi.org/10.1023/B:MATN.0000043480.05267.e7
Issue Date:
DOI: https://doi.org/10.1023/B:MATN.0000043480.05267.e7