Computing equilibria on large multicommodity networks: An application of truncated quadratic programming algorithms

DOI10.1002/net.3230180403zbMath0652.90090OpenAlexW2014730390MaRDI QIDQ3798488

Ron S. Dembo, Ulrich Tulowitzki

Publication date: 1988

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230180403

zbMATH Keywords

rate of convergencecomputation of equilibrialarge-scale nonlinear optimizationsequence of quadratic programmingimprovement of asymptotic algorithm behaviorlarge multicommodity networkstraffic equilibrium calculations

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Quadratic programming (90C20)

Related Items (5)

Bilevel programming in traffic planning: Models, methods and challenge ⋮ Coupling the auxiliary problem principle with descent methods of pseudoconvex programming ⋮ Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis ⋮ Postoptimizing equilibrium flows on large scale networks ⋮ A unified description of iterative algorithms for traffic equilibria

Cites Work

• Minimization of functions having Lipschitz continuous first partial derivatives
• A primal truncated newton algorithm with application to large-scale nonlinear network optimization
• Unnamed Item

This page was built for publication: Computing equilibria on large multicommodity networks: An application of truncated quadratic programming algorithms