A scaled reduced gradient algorithm for network flow problems with convex separable costs
From MaRDI portal
Publication:3934118
DOI10.1007/BFb0120941zbMath0477.90025MaRDI QIDQ3934118
John G. Klincewicz, Ron S. Dembo
Publication date: 1981
Published in: Mathematical Programming Studies (Search for Journal in Brave)
degeneracy; computational experience; reduced gradient methods; second-order information; convex-cost separable network flow problem; water distribution problems
90C35: Programming involving graphs or networks
90C90: Applications of mathematical programming
90C30: Nonlinear programming
90B10: Deterministic network models in operations research
90B99: Operations research and management science
Related Items
Ripples, complements, and substitutes in singly constrained monotropic parametric network flow problems, On large scale nonlinear network optimization, Performance evaluation of independent superbasic sets on nonlinear replicated networks, Dual gradient method for linearly constrained, strongly convex, separable mathematical programming problems, An algorithm for solving quadratic network flow problems, Decomposition algorithm for convex differentiable minimization, On the equivalence of constrained and unconstrained flows, A smooth penalty function algorithm for network-structured problems, Computational comparisons of dual conjugate gradient algorithms for strictly convex networks., The convergence of equilibrium algorithms with non-monotone line search technique., Application of the dual active set algorithm to quadratic network optimization, 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, Dealing with degeneracy in reduced gradient algorithms, A hybrid algorithm for solving convex separable network flow problems, Implementing an “exact” Newton method for separable convex transportation problems, Sandwich approximation of univariate convex functions with an application to separable convex programming
