Dual methods for finding equilibriums in mixed models of flow distribution in large transportation networks

DOI10.1134/S0965542518090075zbMath1407.90053OpenAlexW2897289667WikidataQ129086670 ScholiaQ129086670MaRDI QIDQ1757624

Yu. E. Nesterov, E. V. Gasnikova, Alexander V. Gasnikov

Publication date: 15 January 2019

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542518090075

zbMATH Keywords

primal-dual methodmirror descent methodequilibrium distribution of flows in transportation networksfinding shortest routes

Mathematics Subject Classification ID

Convex programming (90C25) Transportation, logistics and supply chain management (90B06)

Related Items (1)

Fast gradient descent for convex minimization problems with an oracle producing a \(( \delta, L)\)-model of function at the requested point

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints
• Universal method for stochastic composite optimization problems
• Complexity bounds for primal-dual methods minimizing the model of objective function
• On the convergence of descent methods for monotone variational inequalities
• Lectures on Modern Convex Optimization
• Primal-Dual Subgradient Method for Huge-Scale Linear Conic Problems
• Accuracy Certificates for Computational Problems with Convex Structure
• On the three-stage version of stable dynamic model

This page was built for publication: Dual methods for finding equilibriums in mixed models of flow distribution in large transportation networks