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

DOI10.15807/JORSJ.34.263MaRDI QIDQ4006125zbMATH OpenOpenAlexFDO

Authors Satoru Ibaraki, Masao Fukushima, Toshihide 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

continuously differentiable objective functionglobal convergenceNewton methodNonlinear network optimizationunconstrained convex minimization

Mathematics Subject Classification ID

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

Recommendations

• INTERIOR METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS
• scientific article; zbMATH DE number 3869028
• A Newton method for convex separable network flow problems
• An Algorithm for Non-Linear Network Programming: Implementation, Results and Comparisons
• A computationally efficient method for nonlinear multicommodity network flow problems

Cited in

(10)

• Primal-dual proximal point algorithm for linearly constrained convex programming problems
• Convergence of Newton method in nonlinear network analysis
• A global convergent algorithm for flows in a two-dimensional network
• A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem
• Accelerated Dual Descent for Network Flow Optimization
• scientific article; zbMATH DE number 3869028 (Why is no real title available?)
• A Newton method for convex separable network flow problems
• Implementing an “exact” Newton method for separable convex transportation problems
• INTERIOR METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS
• A computationally efficient method for nonlinear multicommodity network flow problems

This page was built for publication: DUAL-BASED NEWTON METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS

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