Мақаланы E-mail арқылы жіберу 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
Дәйексөз келтіру
Ашық рұқсат
Рұқсат берілді
Тек жазылушылар үшін
Аннотация
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
Қосымша файлдар
