A partial linearization method for the traffic assignment problem

DOI10.1080/02331939308843903zbMath0818.90046OpenAlexW2028328252MaRDI QIDQ3835623

Torbjörn Larsson, Athanasios Migdalas, Michael Patriksson

Publication date: 20 April 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939308843903

zbMATH Keywords

partial linearizationtraffic assignmentseparable approximationFrank-Wolfe algorithmfeasible direction methodsLagrangean dualitycoordinate ascentconvex multi-commodity network flowsnonseparable objective function

Mathematics Subject Classification ID

Convex programming (90C25) Deterministic network models in operations research (90B10)

Related Items (6)

A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods ⋮ Bilevel programming in traffic planning: Models, methods and challenge ⋮ An alternating direction method of multipliers for solving user equilibrium problem ⋮ A customized two-stage parallel computing algorithm for solving the combined modal split and traffic assignment problem ⋮ Partial linearization methods in nonlinear programming ⋮ A unified description of iterative algorithms for traffic equilibria

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A distributed algorithm for convex network optimization problems
• On the dual coordinate ascent approach for nonlinear networks
• Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
• An algorithm for nonlinear programs over Cartesian product sets
• Restricted simplicial decomposition: Computation and extensions
• Relaxation Methods for Network Flow Problems with Convex Arc Costs
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• A Primal-Dual Traffic Assignment Algorithm
• A finite algorithm to maximize certain pseudoconcave functions on polytopes
• Simplicial decomposition in nonlinear programming algorithms
• A Reduced Gradient Algorithm for Nonlinear Network Problems
• Accelerated Frank–Wolfe Algorithms

This page was built for publication: A partial linearization method for the traffic assignment problem