Implementing an “exact” Newton method for separable convex transportation problems

DOI10.1002/net.3230190108zbMath0673.90086OpenAlexW2024983129MaRDI QIDQ3827809

John G. Klincewicz

Publication date: 1989

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

Lagrange multipliersNewton methodminimum cost flowtransportation networkKarmarkar's algorithmCholeski type factorization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Convex programming (90C25) Newton-type methods (49M15) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10)

Related Items

Data parallel computing for network-structured optimization problems, Application of the dual active set algorithm to quadratic network optimization, “More(Same)-for-Less” Paradox In Minimal Cost Network Flow Problem, Computational comparisons of dual conjugate gradient algorithms for strictly convex networks., Vector and parallel computing for matrix balancing, Reconstructing and stress testing credit networks

Cites Work

• Unnamed Item
• A polynomial algorithm for minimum quadratic cost flow problems
• Multipoint methods for separable nonlinear networks
• A scaled reduced gradient algorithm for network flow problems with convex separable costs
• On the convergence of a block successive over-relaxation method for a class of linear complementarity problems
• Properties of Kruithof's Projection Method