电邮这篇文章 Convergence and rate of convergence of some greedy algorithms in convex optimization
- 作者: Temlyakov V.N.1,2
-
隶属关系:
- Mathematics Department
- Steklov Mathematical Institute of Russian Academy of Sciences
- 期: 卷 293, 编号 1 (2016)
- 页面: 325-337
- 栏目: Article
- URL: https://journals.rcsi.science/0081-5438/article/view/173849
- DOI: https://doi.org/10.1134/S0081543816040222
- ID: 173849
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
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.
作者简介
V. Temlyakov
Mathematics Department; Steklov Mathematical Institute of Russian Academy of Sciences
编辑信件的主要联系方式.
Email: temlyakovv@gmail.com
美国, 1523 Greene Street, Columbia, SC, 29208; ul. Gubkina 8, Moscow, 119991
补充文件
