Projected Newton methods and optimization of multicommodity flows

DOI10.1109/TAC.1983.1103183MaRDI QIDQ3039012zbMATH OpenFDO

Authors Dimitri P. Bertsekas, Eli Gafni

Publication date 1983

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TAC.1983.1103183

zbMATH Keywords

communication and transportation networkscomputational resultsconjugate gradientlinearly constrained optimizationmulticommodity network flowsuperlinearly convergent Newton like method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Linear programming (90C05) Quadratic programming (90C20)

Cited in

(10)

• ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
• Performance evaluation of independent superbasic sets on nonlinear replicated networks
• An active constraints Newton algorithm for the spatial price equilibrium problem
• Effect of model uncertainty on some optimal routing problems
• A unified description of iterative algorithms for traffic equilibria
• Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks
• Blind deconvolution by a Newton method on the non-unitary hypersphere
• Improving the convergence of simulation-based dynamic traffic assignment methodologies
• A conjugate gradient projection algorithm for the traffic assignment problem
• Analysis of relaxations for the multi-item capacitated lot-sizing problem

This page was built for publication: Projected Newton methods and optimization of multicommodity flows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3039012)