On the dual coordinate ascent approach for nonlinear networks

DOI10.1016/0305-0548(93)90069-UzbMath0770.90023OpenAlexW2085396238MaRDI QIDQ1207203

Norman D. Curet

Publication date: 1 April 1993

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(93)90069-u

zbMATH Keywords

\(\varepsilon\)-optimal solutionconvex separable cost network flowdual coordinate ascent algorithms

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (3)

A survey on the continuous nonlinear resource allocation problem ⋮ A partial linearization method for the traffic assignment problem ⋮ Convergent Lagrangian heuristics for nonlinear minimum cost network flows

Uses Software

• NETGEN
• RELAX4

Cites Work

• Unnamed Item
• Iterative Methods for Large Convex Quadratic Programs: A Survey
• Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs
• Relaxation Methods for Network Flow Problems with Convex Arc Costs
• Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
• OR Practice—Large-Scale Nonlinear Network Models and Their Application
• New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems

This page was built for publication: On the dual coordinate ascent approach for nonlinear networks