toms178


toms178, a FORTRAN90 code which uses the Hooke-Jeeves direct search algorithm to seek the minimizing point of a function F(X) of several variables, by Arthur Kaupe.

The Hooke_Jeeves algorithm does not required the function F(X) to be differentiable. It does not even require the function to be continuous, although it should probably only be "weakly discontinuous", like a step function, with finitely many well-separated jumps. In any case, the algorithm only examines function values, never derivatives, remembers the location of the best value encountered, and seeks to improve this value by a clever pattern search.

The user supplies a quantity rho, between 0 and 1, which controls how cautious or daring the search is, as well as a routine to evaluate the function, and a few input parameters.

A C version of the algorithm, as written by Mark Johnson, is available at https://www.netlib.org/opt/hooke.c

The text of many ACM TOMS algorithms is available online through ACM: https://calgo.acm.org/ or NETLIB: https://www.netlib.org/toms/index.html.

Licensing:

The computer code and data files made available on this web page are distributed under the MIT license

Languages:

toms178 is available in a C version and a C++ version and a Fortran90 version and a MATLAB version and an Octave version and a Python version.

Related Data and Programs:

asa047, a FORTRAN90 code which minimizes a scalar function of several variables using the Nelder-Mead algorithm.

COMPASS_SEARCH, a FORTRAN90 code which seeks the minimizer of a scalar function of several variables using compass search, a direct search algorithm that does not use derivatives.

DQED, a FORTRAN90 code which solves constrained least squares problems.

MINPACK, a FORTRAN90 code which solves systems of nonlinear equations, or the least squares minimization of the residual of a set of linear or nonlinear equations.

NELDER_MEAD, a MATLAB program which minimizes a scalar function of multiple variables using the Nelder-Mead algorithm.

NL2SOL, a FORTRAN90 code which implements an adaptive nonlinear least-squares algorithm.

PRAXIS, a FORTRAN90 code which minimizes a scalar function of several variables, without derivative information.

TEST_NLS, a FORTRAN90 code which defines test problems requiring the least squares minimization of a set of nonlinear functions.

TEST_OPT, a FORTRAN90 code which defines test problems requiring the minimization of a scalar function of several variables.

TEST_OPT_CON, a FORTRAN90 code which defines test problems for the minimization of a scalar function of several variables, with the search constrained to lie within a specified hyper-rectangle.

toms178_test

TOMS611, a FORTRAN90 code which optimizes a scalar functional of multiple variables.

UNCMIN, a FORTRAN77 library which can be used to seek the minimizer of a scalar functional of multiple variables.

Author:

Original Algol version by Arthur Kaupe; FORTRAN90 version by John Burkardt.

Reference:

Source Code:


Last revised on 12 March 2021.