Weak greedy algorithms (Q1968628): Difference between revisions

Theoretical aspects of the efficiency of \(M\)-term approximation is studied for ``weak'' greedy algorithms. These are defined by weaker assumptions than their known analogs: the pure greedy algorithm, an orthogonal greedy algorithm, and a relaxed greedy algorithm. Convergence theorems and rates of approximation by these algorithms are proved. The results apply to approximation from an arbitrary dictionary in a Hilbert space.