The interplay between the intrinsic properties of Banach spaces and the efficiency of greedy methods has led to a deeper understanding of bases such as quasi‐greedy and almost greedy systems ...

Greedy Algorithm: An iterative procedure that, at each step, selects the component offering the greatest immediate improvement in the approximation of an element.

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 ...

This paper considers several "greedy" type algorithms based on grouping parts according to exact matching of field lives. Then, a generalization is presented which allows approximate matches. The ...