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

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

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},
     publisher = {mathdoc},
     volume = {16},
     number = {4},
     year = {2010},
     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
PB  - mathdoc
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
%I mathdoc
%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/