Searching equillibriums in large transport networks
arXiv:1607.03142
Abstract
In this Doctoral Dissertation we propose new variational principles for traffic assignment problems. So to find equillibrium we have to solve large-scale convex optimization problem of special (multilevel) type. We propose different numerical approaches for this problem.
arXiv comment487 pages, in Russian. Moscow Institute of Physics and Technology, 2016
References in corpus (16)
- Making Gradient Descent Optimal for Strongly Convex Stochastic Optimization
- A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights
- Fast Computation of Wasserstein Barycenters
- Mini-Batch Semi-Stochastic Gradient Descent in the Proximal Setting
- On the Global Linear Convergence of Frank-Wolfe Optimization Variants
- An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback
- Even Faster Accelerated Coordinate Descent Using Non-Uniform Sampling
- Stochastic Dual Ascent for Solving Linear Systems
- A Lower Bound for the Optimization of Finite Sums
- Learning Supervised PageRank with Gradient-Based and Gradient-Free Optimization Methods
- Learning From An Optimization Viewpoint
- Simple Complexity Analysis of Simplified Direct Search
- On Accelerated Methods in Optimization
- Stochastic Intermediate Gradient Method for Convex Problems with Inexact Stochastic Oracle
- Decomposition Techniques for Bilinear Saddle Point Problems and Variational Inequalities with Affine Monotone Operators on Domains Given by Linear Minimization Oracles
- Learning Supervised PageRank with Gradient-Free Optimization Methods