RUS  ENG
Full version
JOURNALS // Trudy Instituta Matematiki i Mekhaniki UrO RAN // Archive
Trudy Inst. Mat. i Mekh. UrO RAN, 2010 Volume 16, Number 4, Pages 228–236 (Mi timm656)
Realizability of greedy algorithms

E. D. Livshits

EverNote Corp.

Abstract: 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.

UDC: 517.518.8+519.651.3

Received: 29.12.2009


 English version: Proceedings of the Steklov Institute of Mathematics (Supplement Issues), 2011, 273, suppl. 1, S107–S115

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2025