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

Greedy bases are those bases where the Thresholding Greedy Algorithm (introduced by S. V. Konyagin and V. N. Temlyakov) produces the best possible approximation up to a constant. In 2017, P. M. Berná ...