Enviar artigo por via de e-mail Convergence and rate of convergence of some greedy algorithms in convex optimization
- Autores: Temlyakov V.N.1,2
-
Afiliações:
- Mathematics Department
- Steklov Mathematical Institute of Russian Academy of Sciences
- Edição: Volume 293, Nº 1 (2016)
- Páginas: 325-337
- Seção: Article
- URL: https://journals.rcsi.science/0081-5438/article/view/173849
- DOI: https://doi.org/10.1134/S0081543816040222
- ID: 173849
Citar
Acesso aberto
Acesso está concedido
Somente assinantes
Resumo
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.
Sobre autores
V. Temlyakov
Mathematics Department; Steklov Mathematical Institute of Russian Academy of Sciences
Autor responsável pela correspondência
Email: temlyakovv@gmail.com
Estados Unidos da América, 1523 Greene Street, Columbia, SC, 29208; ul. Gubkina 8, Moscow, 119991
Arquivos suplementares
