Projected Newton methods and optimization of multicommodity flows
From MaRDI portal
Publication:3039012
DOI10.1109/TAC.1983.1103183zbMath0525.90042MaRDI QIDQ3039012
Eli Gafni, Dimitri P. Bertsekas
Publication date: 1983
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
computational resultsconjugate gradientlinearly constrained optimizationmulticommodity network flowcommunication and transportation networkssuperlinearly convergent Newton like method
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Linear programming (90C05) Deterministic network models in operations research (90B10)
Related Items
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, Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks, ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems, Blind deconvolution by a Newton method on the non-unitary hypersphere, 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
