Geodesic
Realizability of greedy algorithms
Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 16 (2010) no. 4, pp. 228-236
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice du chapitre de livre

A purely greedy algorithm and an orthogonally greedy algorithm are studied. It is established that the set of objective functions for which a greedy algorithm can be realized properly has second category for discrete dictionaries.
Keywords: best m-term approximation, greedy algorithms, category. 
@article{TIMM_2010_16_4_a20,
     author = {E. D. Livshits},
     title = {Realizability of greedy algorithms},
     journal = {Trudy Instituta matematiki i mehaniki},
     pages = {228--236},
     year = {2010},
     volume = {16},
     number = {4},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TIMM_2010_16_4_a20/}
}
TY  - JOUR
AU  - E. D. Livshits
TI  - Realizability of greedy algorithms
JO  - Trudy Instituta matematiki i mehaniki
PY  - 2010
SP  - 228
EP  - 236
VL  - 16
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/TIMM_2010_16_4_a20/
LA  - ru
ID  - TIMM_2010_16_4_a20
ER  - 
%0 Journal Article
%A E. D. Livshits
%T Realizability of greedy algorithms
%J Trudy Instituta matematiki i mehaniki
%D 2010
%P 228-236
%V 16
%N 4
%U http://geodesic.mathdoc.fr/item/TIMM_2010_16_4_a20/
%G ru
%F TIMM_2010_16_4_a20
E. D. Livshits. Realizability of greedy algorithms. Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 16 (2010) no. 4, pp. 228-236. http://geodesic.mathdoc.fr/item/TIMM_2010_16_4_a20/

[1] Friedman J.H, Stuetzle W., “Projection pursuit regression”, J. Amer. Statist. Assoc., 76:376 (1981), 817–823 | DOI | MR

[2] Schmidt E., “Zur Theorie der linearen und nichtlinearen Integralgleichungen. 1”, Math. Ann., 63:4 (1906-1907), 433–476 | DOI | MR

[3] Stechkin B.S., Stechkin S.B., “Srednee kvadraticheskoe i srednee arifmeticheskoe”, Dokl. AN SSSR, 137:2 (1961), 287–290 | MR | Zbl

[4] Jones L., “On a conjecture of Huber concerning the convergence of projection pursuit regression”, Ann. Statist., 15:2 (1987), 880–882 | DOI | MR | Zbl

[5] Dubinin V.V., Greedy Algorithms and Applications, Ph.D. Thesis, University of South Carolina, 1997 | MR

[6] Temlyakov V.N., “Greedy approximation”, Acta Numerica, 2008, no. 17, 235–409 | MR | Zbl

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

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

[9] Stechkin S.B., “Approksimativnye svoistva mnozhestv v lineinykh normirovannykh prostranstvakh”, Review Math. Pures Appl., 8:1 (1963), 5–18 | MR