On large scale nonlinear network optimization
Publication:908858
DOI10.1007/BF01582254zbMath0693.90092DBLPjournals/mp/TointT90OpenAlexW2016797051WikidataQ58185964 ScholiaQ58185964MaRDI QIDQ908858
Phillipe L. Toint, Daniel Tuyttens
Publication date: 1990
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01582254
independent superbasic arcslarge dimensional nonlinear network optimizationPartial separabilitypartitioned quasi- Newton updating
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)
Related Items (15)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence properties of trust region methods for linear and convex constraints
- Performance evaluation of independent superbasic sets on nonlinear replicated networks
- Partitioned variable metric updates for large structured optimization problems
- Local convergence analysis for partitioned quasi-Newton updates
- Truncated-Newton algorithms for large-scale unconstrained optimization
- Two-Segment Separable Programming
- Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
- A Newton method for convex separable network flow problems
- Basis exchange characterizations for the simplex son algorithm for LP/embedded networks
- A motivation for using the truncated Newton approach in a very large scale nonlinear network problem
- The performance of NLPNET, a large-scale nonlinear network optimizer
- An efficient implementation of the network simplex method
- A primal truncated newton algorithm with application to large-scale nonlinear network optimization
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- A Nonlinear Network Flow Algorithm for Maximization of Benefits in a Hydroelectric Power System
- A scaled reduced gradient algorithm for network flow problems with convex separable costs
- Inexact Newton Methods
- Matrix conditioning and nonlinear optimization
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
- Solving the Pipe Network Analysis Problem Using Optimization Techniques
- Large-scale linearly constrained optimization
- Basic Linear Algebra Subprograms for Fortran Usage
- Numerical Solution of Large Sets of Algebraic Nonlinear Equations
- On Large Scale Nonlinear Least Squares Calculations
- A Reduced Gradient Algorithm for Nonlinear Network Problems
- Projected Newton Methods for Optimization Problems with Simple Constraints
This page was built for publication: On large scale nonlinear network optimization