Efficient numerical methods for entropy-linear programming problems-Reference-Cited by-同舟云学术

Efficient numerical methods for entropy-linear programming problems

Published:2016-04 Issue:4 Volume:56 Page:514-524
ISSN:0965-5425
Container-title:Computational Mathematics and Mathematical Physics
language:en
Short-container-title:Comput. Math. and Math. Phys.

Author:

Gasnikov A. V.,Gasnikova E. B.,Nesterov Yu. E.,Chernov A. V.

Publisher

Pleiades Publishing Ltd

Subject

Computational Mathematics

Link

http://link.springer.com/content/pdf/10.1134/S0965542516040084.pdf

Reference30 articles.

1. S.-C. Fang, J. R. Rajasekera, and H.-S. J. Tsao, Entropy Optimization and Mathematical Programming (Kluwer, 1997).

2. Yu. S. Popkov, Theory of Macrosystems: Equilibrium Models (URSS, Moscow, 1999) [in Russian].

3. A. G. Wilson, Entropy in Urban and Regional Modeling (Pergamon, Oxford, 1970; Nauka, Moscow, 1978).

4. International Workshops on Bayesian Inference and Maximum Entropy Methods in Science and Engineering, AIP Conference Proceedings (holds every year from 1980).

5. J. N. Kapur, Maximum–Entropy Models in Science and Engineering (Wiley, New York, 1989).

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Randomized Methods for Computing Optimal Transport Without Regularization and Their Convergence Analysis;Journal of Scientific Computing;2024-06-20

2. Near-optimal tensor methods for minimizing the gradient norm of convex functions and accelerated primal–dual tensor methods;Optimization Methods and Software;2024-02-05

3. Primal-dual gradient methods for searching network equilibria in combined models with nested choice structure and capacity constraints;Computational Management Science;2024-01-04

4. Decentralized convex optimization on time-varying networks with application to Wasserstein barycenters;Computational Management Science;2023-12-16

5. Accelerated gradient methods with absolute and relative noise in the gradient;Optimization Methods and Software;2023-06-08