LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems
- 1 September 1992
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 18 (3) , 308-328
- https://doi.org/10.1145/131766.131771
Abstract
The implementation and testing of LSNNO, a new FORTRAN subroutine for solving large-scale nonlinear network optimization problems is described. The implemented algorithm applies the concepts of partial separability and partitioned quasi-Newton updating to high-dimensional nonlinear network optimization problems. Some numerical results on both academic and practical problems are reported.Keywords
This publication has 16 references indexed in Scilit:
- OR Practice—Large-Scale Nonlinear Network Models and Their ApplicationOperations Research, 1989
- Nonlinear programming on generalized networksACM Transactions on Mathematical Software, 1987
- Performance evaluation of independent superbasic sets on nonlinear replicated networksEuropean Journal of Operational Research, 1986
- The performance of NLPNET, a large-scale nonlinear network optimizerPublished by Springer Nature ,1986
- A motivation for using the truncated Newton approach in a very large scale nonlinear network problemPublished by Springer Nature ,1986
- An efficient implementation of the network simplex methodPublished by Springer Nature ,1986
- A Reduced Gradient Algorithm for Nonlinear Network ProblemsACM Transactions on Mathematical Software, 1983
- Projected Newton Methods for Optimization Problems with Simple ConstraintsSIAM Journal on Control and Optimization, 1982
- Partitioned variable metric updates for large structured optimization problemsNumerische Mathematik, 1982
- A scaled reduced gradient algorithm for network flow problems with convex separable costsPublished by Springer Nature ,1981