A Newton method for convex separable network flow problems

DOI10.1002/NET.3230130310MaRDI QIDQ3668258zbMATHOpenAlexFDO

Authors 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

feasible direction algorithmscomputational experienceapproximate 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) Deterministic network models in operations research (90B10) Newton-type methods (49M15)

Recommendations

• Applying a Newton Method to Strictly Convex Separable Network Quadratic Programs
• A hybrid algorithm for solving convex separable network flow problems
• scientific article; zbMATH DE number 1086904
• DUAL-BASED NEWTON METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS
• An implementation of Newton-like methods on nonlinearly constrained networks
• Convexification of generalized network flow problem
• An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems
• The partitioned \(\varepsilon\)-relaxation algorithm for separable convex network flow problems
• Approximate subgradient methods for nonlinearly constrained network flow problems
• Implementing an “exact” Newton method for separable convex transportation problems

Cites work

• scientific article; zbMATH DE number 3686229 (Why is no real title available?)
• A scaled reduced gradient algorithm for network flow problems with convex separable costs

Cited in

(15)

• “More(Same)-for-Less” Paradox In Minimal Cost Network Flow Problem
• scientific article; zbMATH DE number 2206640 (Why is no real title available?)
• Dual gradient method for linearly constrained, strongly convex, separable mathematical programming problems
• On large scale nonlinear network optimization
• Dealing with degeneracy in reduced gradient algorithms
• Computational development of a lagrangian dual approach for quadratic networks
• A hybrid algorithm for solving convex separable network flow problems
• Application of the dual active set algorithm to quadratic network optimization
• A faster version of the ASG algorithm
• Multipoint methods for separable nonlinear networks
• DUAL-BASED NEWTON METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS
• Computational comparisons of dual conjugate gradient algorithms for strictly convex networks.
• Implementing an “exact” Newton method for separable convex transportation problems
• An implementation of Newton-like methods on nonlinearly constrained networks
• Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs

This page was built for publication: A Newton method for convex separable network flow problems

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