Realizability of greedy algorithms
Евгений Давидович Лившиц · Proceedings of the Steklov Institute of Mathematics · 2011
A purely greedy algorithm and an orthogonal greedy algorithm are studied. It is established that the set of objective functions for which a greedy algorithm can be “realized correctly” has second category for discrete dictionaries.