DUAL-BASED NEWTON METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS

DOI10.15807/jorsj.34.263zbMath0747.90038OpenAlexW2097344541MaRDI QIDQ4006125

Toshihide Ibaraki, Masao Fukushima, Satoru Ibaraki

Publication date: 26 September 1992

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.34.263

zbMATH Keywords

global convergenceNewton methodunconstrained convex minimizationcontinuously differentiable objective functionNonlinear network optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Convex programming (90C25) Nonlinear programming (90C30) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Primal-dual proximal point algorithm for linearly constrained convex programming problems