On optimizing a maximin nonlinear function subject to replicated quasi- arborescence-like constraints

DOI10.1007/BF02888547zbMath0734.65052MaRDI QIDQ3361814

Laureano Fernando Escudero Bueno

Publication date: 1985

Published in: Trabajos de Estadistica Y de Investigacion Operativa (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/40743

zbMATH Keywords

nonlinear programmingnumerical algorithmstruncated Newton methodnonlinear functionindependent superbasic setssecond-order informationbasic equivalent pathnetwork-like linear system of constraintsreplicated quasi-arborescence

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (1)

Performance evaluation of independent superbasic sets on nonlinear replicated networks

Cites Work

• On diagonally preconditioning the truncated Newton method for super-scale linearly constrained nonlinear prrogramming
• Truncated-Newton algorithms for large-scale unconstrained optimization
• 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
• Large-scale linearly constrained optimization

This page was built for publication: On optimizing a maximin nonlinear function subject to replicated quasi- arborescence-like constraints