Abstract
Abstract
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.
Funder
Russian Foundation for Basic Research
Ministry of Education and Science of the Russian Federation
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献