A greedy algorithm -- simply put -- is fast but not perfect. The algorithm works under broad guidelines and does not test all the alternatives necessary to obtain an optimal solution.

We consider the problem of approximating a given element f from a Hilbert space $\scr {H}$ by means of greedy algorithms and the application of such procedures to the regression problem in statistical ...