LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems

DOI10.1145/131766.131771zbMath0892.65033OpenAlexW2095169737WikidataQ58185930 ScholiaQ58185930MaRDI QIDQ4371805

Daniel Tuyttens, Phillipe L. Toint

Publication date: 9 February 1998

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1992-18/

zbMATH Keywords

numerical resultsFORTRAN subroutinepartial separabilityquasi-Newton updatinglarge-scale nonlinear network optimization

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

Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization, A class of network optimization methods for planar grid generation, Implementation and test of auction methods for solving generalized network flow problems with separable convex cost, LSNNO

Uses Software

• LANCELOT
• ve08
• NLPNET