Efficient numerical methods for searching equillibriums in large transport networks
Alexander Gasnikov

TL;DR
This paper introduces novel variational principles and algebraic methods for efficiently solving large-scale convex optimization problems to find equilibria in extensive transport networks.
Contribution
It develops new variational principles and algebraic algorithms that enhance the efficiency of computing equilibria in large transportation networks.
Findings
New algebraic framework for traffic equilibrium problems
Numerical algorithms combining optimal methods and algebraic operations
Improved efficiency in large-scale transport network computations
Abstract
We propose new variational principles for traffic assignment problems. So to find equillibrium we have to solve large-scale convex optimization problem of special type. We propose some kind of "algebra" on different models and corresponding numerical algorithms that allows us to combine the optimal method from the basis ones and predescribed operations on methods.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Optimization Algorithms Research · Stochastic Gradient Optimization Techniques · Sparse and Compressive Sensing Techniques
