Convergence and rate of convergence of some greedy algorithms in convex optimization

被引:0
|
作者
V. N. Temlyakov
机构
[1] University of South Carolina,Mathematics Department
[2] Steklov Mathematical Institute of Russian Academy of Sciences,undefined
关键词
D O I
暂无
中图分类号
学科分类号
摘要
The paper gives a systematic study of the approximate versions of three greedy-type algorithms that are widely used in convex optimization. By an approximate version we mean the one where some of evaluations are made with an error. Importance of such versions of greedy-type algorithms in convex optimization and approximation theory was emphasized in previous literature.
引用
收藏
页码:325 / 337
页数:12
相关论文
共 50 条