Geodesic
The rate of convergence of weak greedy approximations over orthogonal dictionaries
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 2 (2017), pp. 68-72
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

Convergence rate of weak orthogonal greedy algorithm is studied for the subspace $\ell^1\subset\ell^2$ and orthogonal dictionaries. It is shown that general results on convergence rate of weak orthogonal greedy algorithms can be essentially improved in the studied case. It is also shown that this improvement is asymptotically sharp. 
@article{VMUMM_2017_2_a12,
     author = {A. S. Orlova},
     title = {The rate of convergence of weak greedy approximations over orthogonal dictionaries},
     journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
     pages = {68--72},
     year = {2017},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMUMM_2017_2_a12/}
}
TY  - JOUR
AU  - A. S. Orlova
TI  - The rate of convergence of weak greedy approximations over orthogonal dictionaries
JO  - Vestnik Moskovskogo universiteta. Matematika, mehanika
PY  - 2017
SP  - 68
EP  - 72
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/VMUMM_2017_2_a12/
LA  - ru
ID  - VMUMM_2017_2_a12
ER  - 
%0 Journal Article
%A A. S. Orlova
%T The rate of convergence of weak greedy approximations over orthogonal dictionaries
%J Vestnik Moskovskogo universiteta. Matematika, mehanika
%D 2017
%P 68-72
%N 2
%U http://geodesic.mathdoc.fr/item/VMUMM_2017_2_a12/
%G ru
%F VMUMM_2017_2_a12
A. S. Orlova. The rate of convergence of weak greedy approximations over orthogonal dictionaries. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 2 (2017), pp. 68-72. http://geodesic.mathdoc.fr/item/VMUMM_2017_2_a12/

[1] Kolmogorov A.N., Fomin S.V., Elementy teorii funktsii i funktsionalnogo analiza, Nauka, M., 1976 | MR

[2] Stechkin S.B., “Ob absolyutnoi skhodimosti ortogonalnykh ryadov”, Dokl. AN SSSR, 102:1 (1955), 37–40 | Zbl

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

[4] Temlyakov V.N., “Weak greedy algorithms”, Adv. Comput. Math., 12:2–3 (2000), 213–227 | DOI | MR | Zbl

[5] Silnichenko A.V., “O skorosti skhodimosti zhadnykh algoritmov”, Matem. zametki, 76:4 (2004), 628–632 | DOI | MR | Zbl

[6] Livshits E.D., “O nizhnikh otsenkakh skorosti skhodimosti zhadnykh algoritmov”, Izv. RAN. Ser. matem., 73:6 (2009), 125–144 | DOI | MR | Zbl