A Newton method for convex separable network flow problems

DOI10.1002/net.3230130310zbMath0518.90016OpenAlexW2093187490MaRDI QIDQ3668258

John G. Klincewicz

Publication date: 1983

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

computational experiencefeasible direction algorithmsapproximate implementationconjugate direction methodconvex, separable network flow problemsquadratically convergent Newton algorithmsecond-order dual multiplier estimates

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Newton-type methods (49M15) Deterministic network models in operations research (90B10)

Related Items

Dual gradient method for linearly constrained, strongly convex, separable mathematical programming problems, Application of the dual active set algorithm to quadratic network optimization, A faster version of the ASG algorithm, “More(Same)-for-Less” Paradox In Minimal Cost Network Flow Problem, Computational comparisons of dual conjugate gradient algorithms for strictly convex networks., On large scale nonlinear network optimization, Unnamed Item, Dealing with degeneracy in reduced gradient algorithms

Cites Work

• A scaled reduced gradient algorithm for network flow problems with convex separable costs
• Unnamed Item