A Newton method for convex separable network flow problems
DOI10.1002/NET.3230130310zbMATH Open0518.90016OpenAlexW2093187490MaRDI QIDQ3668258FDOQ3668258
Authors: John G. Klincewicz 
Publication date: 1983
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230130310
Recommendations
- Applying a Newton Method to Strictly Convex Separable Network Quadratic Programs
- A hybrid algorithm for solving convex separable network flow problems
- scientific article; zbMATH DE number 1086904
- DUAL-BASED NEWTON METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS
- An implementation of Newton-like methods on nonlinearly constrained networks
- Convexification of generalized network flow problem
- An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems
- The partitioned \(\varepsilon\)-relaxation algorithm for separable convex network flow problems
- Approximate subgradient methods for nonlinearly constrained network flow problems
- Implementing an “exact” Newton method for separable convex transportation problems
feasible direction algorithmscomputational experienceapproximate implementationconjugate direction methodconvex, separable network flow problemsquadratically convergent Newton algorithmsecond-order dual multiplier estimates
Numerical mathematical programming methods (65K05) Convex programming (90C25) Deterministic network models in operations research (90B10) Newton-type methods (49M15)
Cites Work
Cited In (15)
- A hybrid algorithm for solving convex separable network flow problems
- Computational comparisons of dual conjugate gradient algorithms for strictly convex networks.
- Computational development of a lagrangian dual approach for quadratic networks
- On large scale nonlinear network optimization
- Multipoint methods for separable nonlinear networks
- Implementing an “exact” Newton method for separable convex transportation problems
- A faster version of the ASG algorithm
- DUAL-BASED NEWTON METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS
- Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs
- An implementation of Newton-like methods on nonlinearly constrained networks
- Title not available (Why is that?)
- Application of the dual active set algorithm to quadratic network optimization
- “More(Same)-for-Less” Paradox In Minimal Cost Network Flow Problem
- Dealing with degeneracy in reduced gradient algorithms
- Dual gradient method for linearly constrained, strongly convex, separable mathematical programming problems
This page was built for publication: A Newton method for convex separable network flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3668258)
