BRENT_OLD
Algorithms for Minimization Without Derivatives


BRENT_OLD is a C++ library which contains algorithms for finding zeros or minima of a scalar function of a scalar variable, by Richard Brent.

The methods do not require the use of derivatives, and do not assume that the function is differentiable.

Licensing:

The computer code and data files described and made available on this web page are distributed under the GNU LGPL license.

Languages:

BRENT is available in a C version and a C++ version and a FORTRAN77 version and a FORTRAN90 version and a MATLAB version.

Related Data and Programs:

ASA047, a C++ library which minimizes a scalar function of several variables using the Nelder-Mead algorithm.

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

GSL, a C++ library which includes rootfinding routines.

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

NMS, a FORTRAN90 library which includes versions of Brent's minimizer and zero finder.

PRAXIS, a FORTRAN90 library which minimizes a scalar function of several variables.

SLATEC, a FORTRAN90 library which includes the zero finder FZERO.

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

TEST_ZERO, a C++ library which defines some test functions for which zeroes can be sought.

TOMS178, a C++ library which optimizes a scalar functional of multiple variables using the Hooke-Jeeves method.

ZOOMIN, a FORTRAN90 library which includes various zero finder routines.

Author:

Richard Brent

Reference:

  1. Richard Brent,
    Algorithms for Minimization without Derivatives,
    Dover, 2002,
    ISBN: 0-486-41998-3,
    LC: QA402.5.B74.

Source Code:

Examples and Tests:

List of Routines:

You can go up one level to the C++ source codes.


Last revised on 23 April 2012.