Computational comparisons of dual conjugate gradient algorithms for strictly convex networks.
From MaRDI portal
Publication:1406626
DOI10.1016/S0305-0548(97)00056-7zbMath1040.90559OpenAlexW2063118024MaRDI QIDQ1406626
Sharon Browning, José A. Ventura, Chih-Hang (John) Wu
Publication date: 7 September 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(97)00056-7
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Uses Software
Cites Work
- On the limited memory BFGS method for large scale optimization
- On the RAS-algorithm
- Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
- Iterative Methods for Large Convex Quadratic Programs: A Survey
- Multipoint methods for separable nonlinear networks
- A Newton method for convex separable network flow problems
- Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs
- A motivation for using the truncated Newton approach in a very large scale nonlinear network problem
- Network Programming Models for Production Scheduling in Multi-Stage, Multi-Item Capacitated Systems
- A lagrangean relaxation algorithm for the constrained matrix problem
- Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs
- A primal truncated newton algorithm with application to large-scale nonlinear network optimization
- Restricted simplicial decomposition: Computation and extensions
- Relaxation Methods for Network Flow Problems with Convex Arc Costs
- Implementing an “exact” Newton method for separable convex transportation problems
- A Nonlinear Network Flow Algorithm for Maximization of Benefits in a Hydroelectric Power System
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- A scaled reduced gradient algorithm for network flow problems with convex separable costs
- Computational development of a lagrangian dual approach for quadratic networks
- Massively Parallel Row-Action Algorithms for Some Nonlinear Transportation Problems
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Some convergence properties of the conjugate gradient method
- Solving the Pipe Network Analysis Problem Using Optimization Techniques
- Large-scale linearly constrained optimization
- Testing of a large-scale network optimization program
- Restart procedures for the conjugate gradient method
- Conjugate Gradient Methods with Inexact Searches
- A Reduced Gradient Algorithm for Nonlinear Network Problems
- Equivalence in nonlinear programming
- Linear Convergence of the Conjugate Gradient Method
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
