On the Rate of Convergence of Greedy Algorithms
In this paper, a new criterion for the evaluation of the theoretical efficiency of a greedy algorithm is suggested. Using this criterion, we prove some results on the rate of convergence of greedy algorithms, which provide expansions. We consider both the case of Hilbert spaces and the more general...
| 发表在: | Mathematics |
|---|---|
| 主要作者: | |
| 格式: | 文件 |
| 语言: | 英语 |
| 出版: |
MDPI AG
2023-06-01
|
| 主题: | |
| 在线阅读: | https://www.mdpi.com/2227-7390/11/11/2559 |