On large scale nonlinear network optimization

DOI10.1007/BF01582254zbMath0693.90092OpenAlexW2016797051WikidataQ58185964 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

zbMATH Keywords

independent superbasic arcslarge dimensional nonlinear network optimizationPartial separabilitypartitioned quasi- Newton updating

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Related Items

Application of the dual active set algorithm to quadratic network optimization, Network planning under uncertainty with an application to hydropower generation, Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization, A fast null-space method for the unsteady Stokes equations, Lagrangian relaxations on networks by \(\varepsilon \)-subgradient methods, Performance of Some Approximate Subgradient Methods over Nonlinearly Constrained Networks, Approximate Subgradient Methods for Lagrangian Relaxations on Networks, A class of network optimization methods for planar grid generation, An implementation of Newton-like methods on nonlinearly constrained networks, An efficient method for nonlinearly constrained networks, A proximal subgradient projection algorithm for linearly constrained strictly convex problems, Approximate subgradient methods for nonlinearly constrained network flow problems, An implementation of linear and nonlinear multicommodity network flows, On the first-order estimation of multipliers from Kuhn-Tucker systems, Dual active sets and constrained optimization

Uses Software

• HSL
• ve08
• VE10
• NLPNET

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