A Reduced Gradient Algorithm for Nonlinear Network Problems

DOI10.1145/356022.356025MaRDI QIDQ4740355zbMATH OpenOpenAlexFDO

Authors

Publication date 1983

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/356022.356025

zbMATH Keywords

software designnonlinear objectivecomputational testingreduced gradient algorithmslinear network constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Nonlinear programming (90C30)

Cited in

(13)

• A survey of dynamic network flows
• The equal flow problem
• A decision model for reducing active power losses during electric power dispatching
• An efficient lagrangean relaxation scheme for linear and integer equal flow problems
• On large scale nonlinear network optimization
• A partial linearization method for the traffic assignment problem
• Performance evaluation of independent superbasic sets on nonlinear replicated networks
• Two-phase generalized reduced gradient method for constrained global optimization
• Application of the dual active set algorithm to quadratic network optimization
• An algorithm for nonlinear programs over Cartesian product sets
• Network simplex algorithm for the general equal flow problem.
• Computational comparisons of dual conjugate gradient algorithms for strictly convex networks.
• Implementation of reduced gradient with bisection algorithms for non-convex optimization problem via stochastic perturbation

This page was built for publication: A Reduced Gradient Algorithm for Nonlinear Network Problems

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