Geodesic
Rate of Convergence of Pure Greedy Algorithms
Matematičeskie zametki, Tome 76 (2004) no. 4, pp. 539-552 
E. D. Livshits. Rate of Convergence of Pure Greedy Algorithms. Matematičeskie zametki, Tome 76 (2004) no. 4, pp. 539-552. http://geodesic.mathdoc.fr/item/MZM_2004_76_4_a6/
@article{MZM_2004_76_4_a6,
     author = {E. D. Livshits},
     title = {Rate of {Convergence} of {Pure} {Greedy} {Algorithms}},
     journal = {Matemati\v{c}eskie zametki},
     pages = {539--552},
     year = {2004},
     volume = {76},
     number = {4},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_2004_76_4_a6/}
}
TY  - JOUR
AU  - E. D. Livshits
TI  - Rate of Convergence of Pure Greedy Algorithms
JO  - Matematičeskie zametki
PY  - 2004
SP  - 539
EP  - 552
VL  - 76
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/MZM_2004_76_4_a6/
LA  - ru
ID  - MZM_2004_76_4_a6
ER  - 
%0 Journal Article
%A E. D. Livshits
%T Rate of Convergence of Pure Greedy Algorithms
%J Matematičeskie zametki
%D 2004
%P 539-552
%V 76
%N 4
%U http://geodesic.mathdoc.fr/item/MZM_2004_76_4_a6/
%G ru
%F MZM_2004_76_4_a6

Voir la notice de l'article provenant de la source Math-Net.Ru

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_{\alpha,\beta}(D)$.

[1] Jones L. K, “On a conjecture of Huber concerning the convergence of PP-regression”, Ann. Statist., 15 (1987), 880–882 | DOI | MR | Zbl

[2] DeVore R. A., Temlyakov V. N., “Some remarks on greedy algorithms”, Adv. Comput. Math., 5 (1996), 173–187 | DOI | MR | Zbl

[3] Konyagin S. V., Temlyakov V. N., “Rate of convergence of pure greedy algorithms”, East J. Approx., 5 (1999), 493–499 | MR

[4] Livshitz E. D., Temlyakov V. N., “Two lower estimates in greedy approximation”, Constructive Approximation, 19 (2003), 509–524 | DOI | MR