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

@article{Dembo1988ComputingEO,
  title={Computing equilibria on large multicommodity networks: An application of truncated quadratic programming algorithms},
  author={Ron S. Dembo and Ulrich Tulowitzki},
  journal={Networks},
  year={1988},
  volume={18},
  pages={273-284}
}
We present a general scheme for improving the asymptotic behavior of a given nonlinear programming algorithm without incurring a significant increase in storage overhead. To enhance the rate of convergence we compute search directions by partially solving a sequence of quadratic programming (QP) problems as suggested by Dembo [6]. The idea is illustrated on a class of extremely large nonlinear programming problems arising from traffic equilibrium calculations using both the Frank-Wolfe and… CONTINUE READING