Email this article Convergence and rate of convergence of some greedy algorithms in convex optimization
- Authors: Temlyakov V.N.1,2
-
Affiliations:
- Mathematics Department
- Steklov Mathematical Institute of Russian Academy of Sciences
- Issue: Vol 293, No 1 (2016)
- Pages: 325-337
- Section: Article
- URL: https://journals.rcsi.science/0081-5438/article/view/173849
- DOI: https://doi.org/10.1134/S0081543816040222
- ID: 173849
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
About the authors
V. N. Temlyakov
Mathematics Department; Steklov Mathematical Institute of Russian Academy of Sciences
Author for correspondence.
Email: temlyakovv@gmail.com
United States, 1523 Greene Street, Columbia, SC, 29208; ul. Gubkina 8, Moscow, 119991
Supplementary files
