On large scale nonlinear network optimization
type: Item
instance of: scholarly article
title: On large scale nonlinear network optimization
zbMATH Open document ID: 0693.90092
DOI: 10.1007/BF01582254
author: Philippe L. Toint
author: Daniel Tuyttens
published in: Mathematical Programming. Series A. Series B
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C06
zbMATH DE Number: 4135735
zbMATH Keywords: independent superbasic arcs
zbMATH Keywords: Partial separability
zbMATH Keywords: partitioned quasi- Newton updating
zbMATH Keywords: large dimensional nonlinear network optimization
describes a project that uses: VE10
describes a project that uses: NLPNET
describes a project that uses: HSL
describes a project that uses: ve08
MaRDI profile type: Publication
Wikidata QID: Q58185964
cites work: A Reduced Gradient Algorithm for Nonlinear Network Problems
cites work: Projected Newton Methods for Optimization Problems with Simple Constraints
cites work: Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
cites work: Convergence properties of trust region methods for linear and convex constraints
cites work: Solving the Pipe Network Analysis Problem Using Optimization Techniques
cites work: Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
cites work: The performance of NLPNET, a large-scale nonlinear network optimizer
cites work: A primal truncated newton algorithm with application to large-scale nonlinear network optimization
cites work: Inexact Newton Methods
cites work: A scaled reduced gradient algorithm for network flow problems with convex separable costs
cites work: Truncated-Newton algorithms for large-scale unconstrained optimization
cites work: Q3702408
cites work: A motivation for using the truncated Newton approach in a very large scale nonlinear network problem
cites work: Performance evaluation of independent superbasic sets on nonlinear replicated networks
cites work: Q3882253
cites work: Q4739659
cites work: Basis exchange characterizations for the simplex son algorithm for LP/embedded networks
cites work: Partitioned variable metric updates for large structured optimization problems
cites work: Local convergence analysis for partitioned quasi-Newton updates
cites work: Q3677522
cites work: Q3313207
cites work: An efficient implementation of the network simplex method
cites work: Q3722233
cites work: Q3968758
cites work: A Newton method for convex separable network flow problems
cites work: Basic Linear Algebra Subprograms for Fortran Usage
cites work: Two-Segment Separable Programming
cites work: Large-scale linearly constrained optimization
cites work: A Nonlinear Network Flow Algorithm for Maximization of Benefits in a Hydroelectric Power System
cites work: Matrix conditioning and nonlinear optimization
cites work: Q3914337
cites work: Numerical Solution of Large Sets of Algebraic Nonlinear Equations
cites work: On Large Scale Nonlinear Least Squares Calculations
cites work: Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
cites work: Q3722270
full work available at URL: https://doi.org/10.1007/bf01582254
OpenAlex ID: W2016797051
DBLP publication ID: journals/mp/TointT90
Recommended article: Q4352996
Recommended article: Q3763915
Recommended article: Global Optimization of Nonlinear Network Design
Recommended article: Q3812006
Recommended article: Non-static network optimization problems: A survey
Recommended article: Q4328102
Recommended article: Nonlinear programming methods and network flows
Recommended article: Network optimization with piecewise linear convex costs
Recommended article: A method of network programming in problems of nonlinear optimization
Recommended article: Complexity and algorithms for convex network optimization and other nonlinear problems
description: scientific article; zbMATH DE number 4135735