Projection Greedy Algorithm

We introduce and study a new type of greedy algorithms, namely, the projection greedy algorithm with respect to a given dictionary in a Hilbert space. We prove its convergence and estimate the rate of convergence for initial elements from the convex hull of the dictionary. Several specific examples of dictionaries are used to compare the introduced algorithm with the orthogonal greedy algorithm.