LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems
From MaRDI portal
Publication:4371805
DOI10.1145/131766.131771zbMath0892.65033WikidataQ58185930 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/
numerical results; FORTRAN subroutine; partial separability; quasi-Newton updating; large-scale nonlinear network optimization
90C35: Programming involving graphs or networks
65K05: Numerical mathematical programming methods
90C06: Large-scale problems in mathematical programming
90C30: Nonlinear programming
Related Items
LSNNO, 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, Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
Uses Software