Golden section search

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Diagram of a golden section search

The golden section search is a technique for finding the extremum (minimum or maximum) of a strictly unimodal function by successively narrowing the range of values inside which the extremum is known to exist. The technique derives its name from the fact that the algorithm maintains the function values for triples of points whose distances form a golden ratio. The algorithm is the limit of Fibonacci search (also described below) for a large number of function evaluations. Fibonacci search and Golden section search were discovered by Kiefer (1953). (see also Avriel and Wilde (1966)).

Basic idea[edit]

The discussion here is posed in terms of searching for a minimum (searching for a maximum is similar) of a unimodal function. Unlike finding a zero, where two function evaluations with opposite sign are sufficient to bracket a root, when searching for a minimum, three values are necessary. The golden section search is an efficient way to reduce progressively the interval locating the minimum. The key is to observe that regardless of how many points have been evaluated, the minimum lies within the interval defined by the two points either side of the least value so far evaluated.

The diagram above illustrates a single step in the technique for finding a minimum. The functional values of are on the vertical axis, and the horizontal axis is the x parameter. The value of has already been evaluated at the three points: , , and . Since is smaller than either or , it is clear that a minimum lies inside the interval from to .

The next step in the minimization process is to "probe" the function by evaluating it at a new value of x, namely . It is most efficient to choose somewhere inside the largest interval, i.e. between and . From the diagram, it is clear that if the function yields then a minimum lies between and and the new triplet of points will be , , and . However if the function yields the value then a minimum lies between and , and the new triplet of points will be , , and . Thus, in either case, we can construct a new narrower search interval that is guaranteed to contain the function's minimum.

Probe point selection[edit]

From the diagram above, it is seen that the new search interval will be either between and with a length of a+c , or between and with a length of b . The golden section search requires that these intervals be equal. If they are not, a run of "bad luck" could lead to the wider interval being used many times, thus slowing down the rate of convergence. To ensure that b = a+c, the algorithm should choose .

However there still remains the question of where should be placed in relation to and . The golden section search chooses the spacing between these points in such a way that these points have the same proportion of spacing as the subsequent triple or . By maintaining the same proportion of spacing throughout the algorithm, we avoid a situation in which is very close to or , and guarantee that the interval width shrinks by the same constant proportion in each step.

Mathematically, to ensure that the spacing after evaluating is proportional to the spacing prior to that evaluation, if is and our new triplet of points is , , and then we want:

However, if is and our new triplet of points is , , and then we want:

Eliminating c from these two simultaneous equations yields:


where φ  is the golden ratio:

The appearance of the golden ratio in the proportional spacing of the evaluation points is how this search algorithm gets its name.

Termination condition[edit]

Because smooth functions are flat (their first derivative is close to zero) near a minimum, attention must be paid not to expect too great an accuracy in locating the minimum. The termination condition provided in the book Numerical Recipes in C is based on testing the gaps among , , and , terminating when within the relative accuracy bounds:

where is a tolerance parameter of the algorithm and is the absolute value of . The check is based on the bracket size relative to its central value, because that relative error in is approximately proportional to the squared absolute error in in typical cases. For that same reason, the Numerical Recipes text recommends that where is the required absolute precision of .


Iterative algorithm[edit]

  • Let [a, b] be interval of current bracket. f(a), f(b) would already have been computed earlier. .
  • Let c = b + (a - b)/φ , d = a + (b - a)/φ. If f(c), f(d) not available, compute them.
  • If f(c) < f(d) (this is to find min, to find max, just reverse it) then move the data: (b, f(b)) ← (d, f(d)), (d, f(d)) ← (c, f(c)) and update c = b + (a - b)/φ and f(c);
  • otherwise, move the data: (a, f(a)) ← (c, f(c)), (c, f(c)) ← (d, f(d)) and update d = a + (b - a)/φ and f(d).
  • At the end of the iteration, [a, c, d, b] bracket the minimum point.
'''python program for golden section search'''
gr = (math.sqrt(5) + 1) / 2

def gss(f, a, b, tol=1e-5):
    golden section search
    to find the minimum of f on [a,b]
    f: a strictly unimodal function on [a,b]

    >>> f = lambda x: (x-2)**2
    >>> x = gss(f, 1, 5)
    >>> x

    c = b - (b - a) / gr
    d = a + (b - a) / gr 
    while abs(c - d) > tol:
        if f(c) < f(d):
            b = d
            a = c

        # we recompute both c and d here to avoid loss of precision which may lead to incorrect results or infinite loop
        c = b - (b - a) / gr
        d = a + (b - a) / gr

    return (b + a) / 2

Recursive algorithm[edit]

double phi = (1 + Math.sqrt(5)) / 2;
double resphi = 2 - phi;

// a and c are the current bounds; the minimum is between them.
// b is a center point
// f(x) is some mathematical function elsewhere defined
// a corresponds to x1; b corresponds to x2; c corresponds to x3
// x corresponds to x4
// tau is a tolerance parameter; see above

public double goldenSectionSearch(double a, double b, double c, double tau) {
    double x;
    if (b < c)
      x = b + resphi * (c - b);
      x = b - resphi * (b - a);
    if (Math.abs(c - a) < tau * (Math.abs(b) + Math.abs(x))) 
      return (c + a) / 2; 
    assert(f(x) != f(b));
    if (f(x) < f(b))
      return (b < c) ? goldenSectionSearch(b, x, c, tau) : goldenSectionSearch(a, x, b, tau);
      return (b < c) ? goldenSectionSearch(a, b, x, tau) : goldenSectionSearch(x, b, c, tau);
def gss(f, a, b, c, tau = 1e-3):
    Python recursive version of Golden Section Search algorithm.

    This code appears to be broken - see the talk page.

    tau is the tolerance for the minimal value of function f
    b is any number between the interval a and c
    goldenRatio = (1 + Math.sqrt(5)) / 2
    if b < c:
        x = b + (2 - goldenRatio) * (c - b)
        x = b - (2 - goldenRatio) * (b - a)
    if abs(c - a) < tau * (abs(b) + abs(x)): 
        return (c + a) / 2
    if f(x) < f(b):
        return gss(f, b, x, c, tau) if b < c else gss(f, a, x, b, tau)
        return gss(f, a, b, x, tau) if b < c else gss(f, x, b, c, tau)

To realise the advantage of golden section search, the function would be implemented with caching, so that in all invocations of goldenSectionSearch(..) above, except the first, would have already been evaluated previously — the result of the calculation will be re-used, bypassing the (perhaps expensive) explicit evaluation of the function. Together with a slightly smaller number of recursions, this 50% saving in the number of calls to is the main algorithmic advantage over Ternary search.

Fibonacci search[edit]

A very similar algorithm can also be used to find the extremum (minimum or maximum) of a sequence of values that has a single local minimum or local maximum. In order to approximate the probe positions of golden section search while probing only integer sequence indices, the variant of the algorithm for this case typically maintains a bracketing of the solution in which the length of the bracketed interval is a Fibonacci number. For this reason, the sequence variant of golden section search is often called Fibonacci search.

Fibonacci search was first devised by Kiefer (1953) as a minimax search for the maximum (minimum) of a unimodal function in an interval.

See also[edit]