Geodesic
Optimality of the greedy algorithm for some function classes
Sbornik. Mathematics, Tome 198 (2007) no. 5, pp. 691-709

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

The convergence rate of the pure greedy algorithm (PGA) is considered. Upper bounds for the convergence rate of the PGA are obtained in the case of the target function in the classes $\widehat{\mathscr A_\gamma}(\mathscr D)$, $\gamma\geqslant0$, which are extensions of the class $\widehat{\mathscr A_1}(\mathscr D)$. This bound is shown to be sharp in order for $\gamma\geqslant2$. Bibliography: 14 titles. 
@article{SM_2007_198_5_a4,
     author = {E. D. Livshits},
     title = {Optimality of the greedy algorithm for some function classes},
     journal = {Sbornik. Mathematics},
     pages = {691--709},
     publisher = {mathdoc},
     volume = {198},
     number = {5},
     year = {2007},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/SM_2007_198_5_a4/}
}
TY  - JOUR
AU  - E. D. Livshits
TI  - Optimality of the greedy algorithm for some function classes
JO  - Sbornik. Mathematics
PY  - 2007
SP  - 691
EP  - 709
VL  - 198
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SM_2007_198_5_a4/
LA  - en
ID  - SM_2007_198_5_a4
ER  - 
%0 Journal Article
%A E. D. Livshits
%T Optimality of the greedy algorithm for some function classes
%J Sbornik. Mathematics
%D 2007
%P 691-709
%V 198
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SM_2007_198_5_a4/
%G en
%F SM_2007_198_5_a4
E. D. Livshits. Optimality of the greedy algorithm for some function classes. Sbornik. Mathematics, Tome 198 (2007) no. 5, pp. 691-709. http://geodesic.mathdoc.fr/item/SM_2007_198_5_a4/