Golden-section search

The golden-section search is a technique for finding an extremum (minimum or maximum) of a function inside a specified interval. For a strictly unimodal function with an extremum inside the interval, it will find that extremum, while for an interval containing multiple extrema (possibly including the interval boundaries), it will converge to one of them. If the only extremum on the interval is on a boundary of the interval, it will converge to that boundary point. The method operates by successively narrowing the range of values on the specified interval, which makes it relatively slow, but very robust. The technique derives its name from the fact that the algorithm maintains the function values for four points whose three interval widths are in the ratio φ:1:φ, where φ is the golden ratio. These ratios are maintained for each iteration and are maximally efficient. Excepting boundary points, when searching for a minimum, the central point is always less than or equal to the outer points, assuring that a minimum is contained between the outer points. The converse is true when searching for a maximum. The algorithm is the limit of Fibonacci search (also described below) for many function evaluations. Fibonacci search and golden-section search were discovered by Kiefer (1953) (see also Avriel and Wilde (1966)).

Basic idea

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 progressively reduce 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 adjacent to the point with the least value so far evaluated.

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

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

Probe point selection

From the diagram above, it is seen that the new search interval will be either between $x_{1}$ and $x_{4}$ with a length of a + c, or between $x_{2}$ and $x_{3}$ 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 $x_{4}=x_{1}+(x_{3}-x_{2})$ .

However, there still remains the question of where $x_{2}$ should be placed in relation to $x_{1}$ and $x_{3}$ . 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 $x_{1},x_{2},x_{4}$ or $x_{2},x_{4},x_{3}$ . By maintaining the same proportion of spacing throughout the algorithm, we avoid a situation in which $x_{2}$ is very close to $x_{1}$ or $x_{3}$ and guarantee that the interval width shrinks by the same constant proportion in each step.

Mathematically, to ensure that the spacing after evaluating $f(x_{4})$ is proportional to the spacing prior to that evaluation, if $f(x_{4})$ is $f_{4a}$ and our new triplet of points is $x_{1}$ , $x_{2}$ , and $x_{4}$ , then we want

{\frac {c}{a}}={\frac {a}{b}}.

However, if $f(x_{4})$ is $f_{4b}$ and our new triplet of points is $x_{2}$ , $x_{4}$ , and $x_{3}$ , then we want

{\frac {c}{b-c}}={\frac {a}{b}}.

Eliminating c from these two simultaneous equations yields

\left({\frac {b}{a}}\right)^{2}-{\frac {b}{a}}=1,

or

{\frac {b}{a}}=\varphi ,

where φ is the golden ratio:

\varphi ={\frac {1+{\sqrt {5}}}{2}}=1.618033988\ldots

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

Termination condition

Any number of termination conditions may be applied, depending upon the application. The interval ΔX = X₄ − X₁ is a measure of the absolute error in the estimation of the minimum X and may be used to terminate the algorithm. The value of ΔX is reduced by a factor of r = φ − 1 for each iteration, so the number of iterations to reach an absolute error of ΔX is about ln(ΔX/ΔX₀) / ln(r), where ΔX₀ is the initial value of ΔX.

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 $x_{1}$ , $x_{2}$ , $x_{3}$ and $x_{4}$ , terminating when within the relative accuracy bounds

|x_{3}-x_{1}|<\tau {\big (}|x_{2}|+|x_{4}|{\big )},

where $\tau$ is a tolerance parameter of the algorithm, and $|x|$ is the absolute value of $x$ . The check is based on the bracket size relative to its central value, because that relative error in $x$ is approximately proportional to the squared absolute error in $f(x)$ in typical cases. For that same reason, the Numerical Recipes text recommends that $\tau ={\sqrt {\varepsilon }}$ , where $\varepsilon$ is the required absolute precision of $f(x)$ .

Algorithm

Note! The examples here describe an algorithm that is for finding the minimum of a function. For maximum, the comparison operators need to be reversed.

Iterative algorithm

Specify the function to be minimized, ⁠ $f(x)$ ⁠, the interval to be searched as {X₁,X₄}, and their functional values F₁ and F₄.
Calculate an interior point and its functional value F₂. The two interval lengths are in the ratio c : r or r : c where r = φ − 1; and c = 1 − r, with φ being the golden ratio.
Using the triplet, determine if convergence criteria are fulfilled. If they are, estimate the X at the minimum from that triplet and return.
From the triplet, calculate the other interior point and its functional value. The three intervals will be in the ratio ⁠ $c:cr:c$ ⁠.
The three points for the next iteration will be the one where F is a minimum, and the two points closest to it in X.
Go to step 3.

"""
Python program for golden section search.  This implementation
does not reuse function evaluations and assumes the minimum is c
or d (not on the edges at a or b)
"""

import math

invphi = (math.sqrt(5) - 1) / 2  # 1 / phi


def gss(f, a, b, tolerance=1e-5):
    """
    Golden-section search
    to find the minimum of f on [a,b]

    * f: a strictly unimodal function on [a,b]

    Example:
    >>> def f(x): return (x - 2) ** 2
    >>> x = gss(f, 1, 5)
    >>> print(f"{x:.5f}")
    2.00000

    """
    while b - a > tolerance:
        c = b - (b - a) * invphi
        d = a + (b - a) * invphi
        if f(c) < f(d):
            b = d
        else:  # f(c) > f(d) to find the maximum
            a = c

    return (b + a) / 2

// a and c define range to search
// func(x) returns value of function at x to be minimized
function goldenSection(a, c, func) {
  function split(x1, x2) { return x1 + 0.6180339887498949*(x2-x1); }
  var b = split(a, c);
  var bv = func(b);
  while (a != c) {
    var x = split(a, b);
    var xv = func(x);
    if (xv < bv) {
      bv = xv;
      c = b;
      b = x;
    }
    else {
      a = c;
      c = x;
    }
  }
  return b;
}
function test(x) { return -Math.sin(x); }
console.log(goldenSection(0, 3, test)); // prints PI/2

"""
Python program for golden section search.  This implementation
does not reuse function evaluations and assumes the minimum is c
or d (not on the edges at a or b)
"""

import math

invphi = (math.sqrt(5) - 1) / 2  # 1 / phi
invphi2 = (3 - math.sqrt(5)) / 2  # 1 / phi^2


def gss(f, a, b, tolerance=1e-5):
    """
    Golden-section search.

    Given a function f with a single local minimum in
    the interval [a,b], gss returns a subset interval
    [c,d] that contains the minimum with d-c <= tolerance.

    Example:
    >>> def f(x): return (x - 2) ** 2
    >>> print(*gss(f, a=1, b=5, tolerance=1e-5))
    1.9999959837979107 2.0000050911830893
    """
    a, b = min(a, b), max(a, b)
    h = b - a
    if h <= tolerance:
        return (a, b)

    # Required steps to achieve tolerance
    n = int(math.ceil(math.log(tolerance / h) / math.log(invphi)))

    c, d = a + invphi2 * h, a + invphi * h
    yc, yd = f(c), f(d)

    for _ in range(n - 1):
        h *= invphi
        if yc < yd:
            b, d = d, c
            yd = yc
            c = a + invphi2 * h
            yc = f(c)
        else:  # yc > yd to find the maximum
            a, c = c, d
            yc = yd
            d = a + invphi * h
            yd = f(d)

    return (a, d) if yc < yd else (c, b)

Recursive algorithm

public class GoldenSectionSearch {
    public static final double invphi = (Math.sqrt(5.0) - 1) / 2.0;
    public static final double invphi2 = (3 - Math.sqrt(5.0)) / 2.0;

    public interface Function {
        double of(double x);
    }

    // Returns subinterval of [a,b] containing minimum of f

    public static double[] gss(Function f, double a, double b, double tol) {
        return gss(f, a, b, tol, b - a, true, 0, 0, true, 0, 0);
    }
    private static double[] gss(Function f, double a, double b, double tol,
                                double h, boolean noC, double c, double fc,
                                boolean noD, double d, double fd) {
        if (Math.abs(h) <= tol) {
            return new double[] { a, b };
        }
        if (noC) {
            c = a + invphi2 * h;
            fc = f.of(c);
        }
        if (noD) {
            d = a + invphi * h;
            fd = f.of(d);
        }
        if (fc < fd) {  // fc > fd to find the maximum
            return gss(f, a, d, tol, h * invphi, true, 0, 0, false, c, fc);
        } else {
            return gss(f, c, b, tol, h * invphi, false, d, fd, true, 0, 0);
        }
    }

    public static void main(String[] args) {
        Function f = (x)->Math.pow(x-2, 2);
        double a = 1;
        double b = 5;
        double tol = 1e-5;
        double [] ans = gss(f, a, b, tol);
        System.out.println("[" + ans[0] + "," + ans[1] + "]");
        // [1.9999959837979107,2.0000050911830893]
    }
}

import math


invphi = (math.sqrt(5) - 1) / 2  # 1 / phi
invphi2 = (3 - math.sqrt(5)) / 2  # 1 / phi^2


def gssrec(f, a, b, tol=1e-5, h=None, c=None, d=None, fc=None, fd=None):
    """Golden-section search, recursive.

    Given a function f with a single local minimum in
    the interval [a, b], gss returns a subset interval
    [c, d] that contains the minimum with d-c <= tol.

    Example:
    >>> f = lambda x: (x - 2) ** 2
    >>> a = 1
    >>> b = 5
    >>> tol = 1e-5
    >>> (c, d) = gssrec(f, a, b, tol)
    >>> print (c, d)
    1.9999959837979107 2.0000050911830893
    """

    (a, b) = (min(a, b), max(a, b))
    if h is None:
        h = b - a
    if h <= tol:
        return (a, b)
    if c is None:
        c = a + invphi2 * h
    if d is None:
        d = a + invphi * h
    if fc is None:
        fc = f(c)
    if fd is None:
        fd = f(d)
    if fc < fd:  # fc > fd to find the maximum
        return gssrec(f, a, d, tol, h * invphi, c=None, fc=None, d=c, fd=fc)
    else:
        return gssrec(f, c, b, tol, h * invphi, c=d, fc=fd, d=None, fd=None)

Related algorithms

Fibonacci search

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.

Bisection method

The Bisection method is a similar algorithm for finding a zero of a function. Note that, for bracketing a zero, only two points are needed, rather than three. The interval ratio decreases by 2 in each step, rather than by the golden ratio.

References

Kiefer, J. (1953), "Sequential minimax search for a maximum", Proceedings of the American Mathematical Society, 4 (3): 502–506, doi:10.2307/2032161, JSTOR 2032161, MR 0055639
Avriel, Mordecai; Wilde, Douglass J. (1966), "Optimality proof for the symmetric Fibonacci search technique", Fibonacci Quarterly, 4 (3): 265–269, doi:10.1080/00150517.1966.12431364, MR 0208812

Press, WH; Teukolsky, SA; Vetterling, WT; Flannery, BP (2007), "Section 10.2. Golden Section Search in One Dimension", Numerical Recipes: The Art of Scientific Computing (3rd ed.), New York: Cambridge University Press, ISBN 978-0-521-88068-8, archived from the original on 2011-08-11, retrieved 2011-08-12