TOMS611S - Unconstrained Minimization (Single Precision)

TOMS611S is ACM TOMS algorithm 611, the single precision version. It contains routines for the general unconstrained minimization of a scalar function of several variables. The routines use a model/trust-region approach, and the double-dogleg technique of Dennis and Mei. In cases where the Hessian is not supplied by the user, the BFGS secant update is used instead.

Three different implementations of the algorithm are available, which allow the user to supply just the function, the function and gradient, or function, gradient and hessian.

The user may also choose to supply the information about the function through subroutines, or to use a version of the algorithm that employs "reverse communication", allowing the user to evaluate the function in any suitable way.

The original, true, correct version of TOMS 611 is available in the TOMS subdirectory of the NETLIB web site.

Files you may copy include:

The list of routines includes:

Return to the FORTRAN software page.


Last revised on 01 June 2001.