|
Trudy Instituta Matematiki i Mekhaniki 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.
Received: 29.12.2009
Citation:
E. D. Livshits, “Realizability of greedy algorithms”, Trudy Inst. Mat. i Mekh. UrO RAN, 16, no. 4, 2010, 228–236; Proc. Steklov Inst. Math. (Suppl.), 273, suppl. 1 (2011), S107–S115
Linking options:
https://www.mathnet.ru/eng/timm656 https://www.mathnet.ru/eng/timm/v16/i4/p228
|
Statistics & downloads: |
Abstract page: | 236 | Full-text PDF : | 86 | References: | 33 |
|