Universal Method of Searching for Equilibria and Stochastic Equilibria in Transportation Networks
- 1 January 2019
- journal article
- research article
- Published by Pleiades Publishing Ltd in Computational Mathematics and Mathematical Physics
- Vol. 59 (1) , 19-33
Abstract
A universal method of searching for usual and stochastic equilibria in congestion population games is proposed. The Beckmann and stable dynamics models of an equilibrium flow distribution...Keywords
This publication has 19 references indexed in Scilit:
- Efficient numerical methods for entropy-linear programming problemsComputational Mathematics and Mathematical Physics, 2016
- Universal gradient methods for convex optimization problemsMathematical Programming, 2014
- On entropy-type functionals arising in stochastic chemical kinetics related to the concentration of the invariant measure and playing the role of Lyapunov functions in the dynamics of quasiaveragesMathematical Notes, 2013
- Accuracy Certificates for Computational Problems with Convex StructureMathematics of Operations Research, 2010
- Reversibility and irreversibility in stochastic chemical kineticsRussian Mathematical Surveys, 2008
- Primal-dual subgradient methods for convex problemsMathematical Programming, 2007
- Characteristic functions of directed graphs and applications to stochastic equilibrium problemsOptimization and Engineering, 2007
- Smooth minimization of non-smooth functionsMathematical Programming, 2004
- Convex Optimization2004
- Stationary Dynamic Solutions in Congested Transportation Networks: Summary and PerspectivesNetworks and Spatial Economics, 2003