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

  • Authors:
  • Ph. L. Toint;D. Tuyttens

  • Affiliations:
  • Faculty Universitaires ND de la Paix;Faculty Universitaires ND de la Paix

  • Venue:
  • ACM Transactions on Mathematical Software (TOMS)
  • Year:
  • 1992

Quantified Score

Hi-index 0.00

Visualization

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.