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

DOI10.1007/BFB0120941zbMath0477.90025OpenAlexW186009904MaRDI QIDQ3934118

Ron S. Dembo, John G. Klincewicz

Publication date: 1981

Published in: Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0120941

zbMATH Keywords

degeneracycomputational experiencereduced gradient methodssecond-order informationconvex-cost separable network flow problemwater distribution problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Nonlinear programming (90C30) Deterministic network models in operations research (90B10) Operations research and management science (90B99)

Related Items (18)

Dual gradient method for linearly constrained, strongly convex, separable mathematical programming problems ⋮ A hybrid algorithm for solving convex separable network flow problems ⋮ Application of the dual active set algorithm to quadratic network optimization ⋮ On the equivalence of constrained and unconstrained flows ⋮ Sandwich approximation of univariate convex functions with an application to separable convex programming ⋮ Ripples, complements, and substitutes in singly constrained monotropic parametric network flow problems ⋮ A smooth penalty function algorithm for network-structured problems ⋮ Computational comparisons of dual conjugate gradient algorithms for strictly convex networks. ⋮ On large scale nonlinear network optimization ⋮ The convergence of equilibrium algorithms with non-monotone line search technique. ⋮ An algorithm for solving quadratic network flow problems ⋮ Decomposition algorithm for convex differentiable minimization ⋮ Implementing an “exact” Newton method for separable convex transportation problems ⋮ Truncated-Newton algorithms for large-scale unconstrained optimization ⋮ On optimizing a maximin nonlinear function subject to replicated quasi- arborescence-like constraints ⋮ A Newton method for convex separable network flow problems ⋮ Performance evaluation of independent superbasic sets on nonlinear replicated networks ⋮ Dealing with degeneracy in reduced gradient algorithms

This page was built for publication: A scaled reduced gradient algorithm for network flow problems with convex separable costs