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

DOI10.1002/NET.3230190108zbMATH Open0673.90086OpenAlexW2024983129MaRDI QIDQ3827809FDOQ3827809

Authors: 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

Recommendations

• A Newton method for convex separable network flow problems
• DUAL-BASED NEWTON METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS
• A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
• A hybrid algorithm for solving convex separable network flow problems
• INTERIOR METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS

zbMATH Keywords

Lagrange multipliersNewton methodminimum cost flowtransportation networkKarmarkar's algorithmCholeski type factorization

Mathematics Subject Classification ID

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

Cites Work

• A polynomial algorithm for minimum quadratic cost flow problems
• On the convergence of a block successive over-relaxation method for a class of linear complementarity problems
• Properties of Kruithof's Projection Method
• Title not available (Why is that?)
• A scaled reduced gradient algorithm for network flow problems with convex separable costs
• Multipoint methods for separable nonlinear networks

Cited In (7)

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

This page was built for publication: Implementing an “exact” Newton method for separable convex transportation problems

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