Efficient numerical methods for entropy-linear programming problems
- Autores: Gasnikov A.V.1, Gasnikova E.B.2, Nesterov Y.E.3, Chernov A.V.2
-
Afiliações:
- Institute for Information Transmission Problems
- Moscow Institute of Physics and Technology
- Center for Operations Research and Econometrics
- Edição: Volume 56, Nº 4 (2016)
- Páginas: 514-524
- Seção: Article
- URL: https://journals.rcsi.science/0965-5425/article/view/178370
- DOI: https://doi.org/10.1134/S0965542516040084
- ID: 178370
Citar
Resumo
Entropy-linear programming (ELP) problems arise in various applications. They are usually written as the maximization of entropy (minimization of minus entropy) under affine constraints. In this work, new numerical methods for solving ELP problems are proposed. Sharp estimates for the convergence rates of the proposed methods are established. The approach described applies to a broader class of minimization problems for strongly convex functionals with affine constraints.
Palavras-chave
Sobre autores
A. Gasnikov
Institute for Information Transmission Problems
Autor responsável pela correspondência
Email: gasnikov@yandex.ru
Rússia, Bolshoi Karetnyi per. 19/1, Moscow, 127051
E. Gasnikova
Moscow Institute of Physics and Technology
Email: gasnikov@yandex.ru
Rússia, Institutskii per. 9, Dolgoprudnyi, Moscow oblast, 141700
Yu. Nesterov
Center for Operations Research and Econometrics
Email: gasnikov@yandex.ru
Bélgica, Louvain
A. Chernov
Moscow Institute of Physics and Technology
Email: gasnikov@yandex.ru
Rússia, Institutskii per. 9, Dolgoprudnyi, Moscow oblast, 141700
Arquivos suplementares
