Geodesic
Comparison of the Convergence Rate of Pure Greedy and Orthogonal Greedy Algorithms
Matematičeskie zametki, Tome 92 (2012) no. 4, pp. 528-532

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

The following two types of greedy algorithms are considered: the pure greedy algorithm (PGA) and the orthogonal greedy algorithm (OGA). From the standpoint of estimating the rate of convergence on the entire class $\mathscr A_1(\mathscr D)$, the orthogonal greedy algorithm is optimal and significantly exceeds the pure greedy algorithm. The main result in the present paper is the assertion that the situation can also be opposite for separate elements of the class $\mathscr A_1(\mathscr D)$ (and even of the class $\mathscr A_0(\mathscr D)$): the rate of convergence of the orthogonal greedy algorithm can be significantly lower than the rate of convergence of the pure greedy algorithm.
Keywords: pure greedy algorithm, orthogonal greedy algorithm, dictionary, rate of convergence, Hilbert space, the classes $\mathscr A_1(\mathscr D)$ and $\mathscr A_0(\mathscr D)$. 
@article{MZM_2012_92_4_a3,
     author = {A. V. Dereventsov},
     title = {Comparison of the {Convergence} {Rate} of {Pure} {Greedy} and {Orthogonal} {Greedy} {Algorithms}},
     journal = {Matemati\v{c}eskie zametki},
     pages = {528--532},
     publisher = {mathdoc},
     volume = {92},
     number = {4},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_2012_92_4_a3/}
}
TY  - JOUR
AU  - A. V. Dereventsov
TI  - Comparison of the Convergence Rate of Pure Greedy and Orthogonal Greedy Algorithms
JO  - Matematičeskie zametki
PY  - 2012
SP  - 528
EP  - 532
VL  - 92
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_2012_92_4_a3/
LA  - ru
ID  - MZM_2012_92_4_a3
ER  - 
%0 Journal Article
%A A. V. Dereventsov
%T Comparison of the Convergence Rate of Pure Greedy and Orthogonal Greedy Algorithms
%J Matematičeskie zametki
%D 2012
%P 528-532
%V 92
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_2012_92_4_a3/
%G ru
%F MZM_2012_92_4_a3
A. V. Dereventsov. Comparison of the Convergence Rate of Pure Greedy and Orthogonal Greedy Algorithms. Matematičeskie zametki, Tome 92 (2012) no. 4, pp. 528-532. http://geodesic.mathdoc.fr/item/MZM_2012_92_4_a3/