Universal method of searching for equilibria and stochastic equilibria in transportation networks
DOI10.1134/S0965542519010020zbMath1419.90013OpenAlexW2945222577WikidataQ127856117 ScholiaQ127856117MaRDI QIDQ2314190
Pavel Dvurechensky, Alexander V. Gasnikov, E. I. Ershov, D. R. Baimurzina, E. V. Gasnikova, M. B. Kubentaeva, A. A. Lagunovskaya
Publication date: 19 July 2019
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0965542519010020
dual problemtransportation networksBeckmann's modelstable dynamics modeltransportation flowsuniversal method of similar triangles
Convex programming (90C25) Noncooperative games (91A10) Transportation, logistics and supply chain management (90B06)
Related Items (6)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primal-dual subgradient methods for convex problems
- Smooth minimization of non-smooth functions
- Efficient numerical methods for entropy-linear programming problems
- Gradient methods for minimizing composite functions
- Universal gradient methods for convex optimization problems
- Characteristic functions of directed graphs and applications to stochastic equilibrium problems
- Extremes and related properties of random sequences and processes
- Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints
- Universal method for stochastic composite optimization problems
- On the convergence of descent methods for monotone variational inequalities
- 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 quasiaverages
- Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear Constraints
- Accuracy Certificates for Computational Problems with Convex Structure
- About reduction of searching competetive equillibrium to the minimax problem in application to different network problems
- Reversibility and irreversibility in stochastic chemical kinetics
- On the three-stage version of stable dynamic model
This page was built for publication: Universal method of searching for equilibria and stochastic equilibria in transportation networks