Abstract:
We define various algorithms for greedy approximations by elements of an arbitrary set $M$ in a Banach space. We study the convergence of these algorithms in a Hilbert space under various geometric conditions on $M$. As a consequence, we obtain sufficient conditions for the additive semigroup generated by $M$ to be dense.
Keywords:greedy approximation, Hilbert space, density of a semigroup.