Answers are grounded in this paper and cite their sources.
We define various algorithms for greedy approximations by elements of an arbitrary set in a Banach space. We study the convergence of these algorithms in a Hilbert space under various geometric conditions on . As a consequence, we obtain sufficient conditions for the additive semigroup generated by to be dense.
No takes yet. Share an insight, caveat, or question.
П. А. Бородин (2019) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: