Previous Page Parent Page Next Page TOC


The NL2SOL method is based on an adaptive nonlinear least-squares algorithm, devised by Dennis and colleagues[Dennis81]. For problems with large number of residuals, this algorithm is known to be more reliable than Gauss-Newton or Levenberg-Marquardt method and more efficient than the secant or variable metric algorithms that are intended for general function minimization. A more complete description of the method can be found in [Dennis81] and [Dennis81b].

This implementation of the NL2SOL method was originally written in FORTRAN by John E. Dennis, Jr. (Rice University), David M. Gay (Massachusetts Institute of Technology) and Roy E. Welsch (Massachusetts Institute of Technology). The original code is available from The original code was translated automatically to C by the F2C program from AT&T Bell Labs (available at ). The C code was then enhanced to suite COPASI's reentrant optimization method interface.

Options for NL2SOL

Iteration Limit
This parameter is a positive integer to determine the maximum number of iterations the method is to perform. The default value is '2000'.