|
This article is cited in 23 scientific papers (total in 23 papers)
Efficient numerical methods for entropy-linear programming problems
A. V. Gasnikovab, E. V. Gasnikovac, Yu. E. Nesterovd, A. V. Chernovc a Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute), Moscow
b National Research University "Higher School of Economics" (HSE), Moscow
c Moscow Institute of Physics and Technology (State University), Dolgoprudny, Moscow region
d Center for Operat. Research and Econometrics Universite Catholigue de Louvain, Belgium
Abstract:
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.
Key words:
entropy-linear programming, fast gradient method, regularization, dual problem.
Received: 04.03.2015 Revised: 28.05.2015
Citation:
A. V. Gasnikov, E. V. Gasnikova, Yu. E. Nesterov, A. V. Chernov, “Efficient numerical methods for entropy-linear programming problems”, Zh. Vychisl. Mat. Mat. Fiz., 56:4 (2016), 523–534; Comput. Math. Math. Phys., 56:4 (2016), 514–524
Linking options:
https://www.mathnet.ru/eng/zvmmf10368 https://www.mathnet.ru/eng/zvmmf/v56/i4/p523
|
Statistics & downloads: |
Abstract page: | 563 | Full-text PDF : | 150 | References: | 101 | First page: | 21 |
|