Go to the first, previous, next, last section, table of contents.

Minimization Algorithms

The minimization algorithms described in this section require an initial interval which is guaranteed to contain a minimum -- if @math{a} and @math{b} are the endpoints of the interval and @math{x} is an estimate of the minimum then @math{f(a) > f(x) < f(b)}. This ensures that the function has at least one minimum somewhere in the interval. If a valid initial interval is used then these algorithm cannot fail, provided the function is well-behaved.

Minimizer: gsl_min_fminimizer_goldensection

The golden section algorithm is the simplest method of bracketing the minimum of a function. It is the slowest algorithm provided by the library, with linear convergence.

On each iteration, the algorithm first compares the subintervals from the endpoints to the current minimum. The larger subinterval is divided in a golden section (using the famous ratio @math{(3-\sqrt 5)/2 = 0.3189660}...) and the value of the function at this new point is calculated. The new value is used with the constraint @math{f(a') > f(x') < f(b')} to a select new interval containing the minimum, by discarding the least useful point. This procedure can be continued indefinitely until the interval is sufficiently small. Choosing the golden section as the bisection ratio can be shown to provide the fastest convergence for this type of algorithm.

Minimizer: gsl_min_fminimizer_brent

The Brent minimization algorithm combines a parabolic interpolation with the golden section algorithm. This produces a fast algorithm which is still robust.

The outline of the algorithm can be summarized as follows: on each iteration Brent's method approximates the function using an interpolating parabola through three existing points. The minimum of the parabola is taken as a guess for the minimum. If it lies within the bounds of the current interval then the interpolating point is accepted, and used to generate a smaller interval. If the interpolating point is not accepted then the algorithm falls back to an ordinary golden section step. The full details of Brent's method include some additional checks to improve convergence.

Go to the first, previous, next, last section, table of contents.