Nonlinear network programming on vector supercomputers: A study on the CRAY X-MP
Operations Research
Nonlinear programming on generalized networks
ACM Transactions on Mathematical Software (TOMS)
Vectorization and multitasking of nonlinear network programming algorithms
Mathematical Programming: Series A and B
On large scale nonlinear network optimization
Mathematical Programming: Series A and B
Basic Linear Algebra Subprograms for Fortran Usage
ACM Transactions on Mathematical Software (TOMS)
A Reduced Gradient Algorithm for Nonlinear Network Problems
ACM Transactions on Mathematical Software (TOMS)
Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Classics in Applied Mathematics, 16)
Impact of Partial Separability on Large-Scale Optimization
Computational Optimization and Applications
A Partitioned ε-Relaxation Algorithm for Separable Convex
Computational Optimization and Applications - Special issue on computational optimization—a tribute to Olvi Mangasarian, part I
A Class of Global Optimization Problems as Models of the Phase Unwrapping Problem
Journal of Global Optimization
Journal of Optimization Theory and Applications
A class of network optimization methods for planar grid generation
Applied Numerical Mathematics
A class of network optimization methods for planar grid generation
Applied Numerical Mathematics
Hi-index | 0.00 |
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.