Golden Section Search - Fibonacci Search

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.

Read more about this topic:  Golden Section Search

Famous quotes containing the word search:

    why
    Do our black faces search the empty sky?
    Is there something we have forgotten? some precious thing
    We have lost, wandering in strange lands?
    Arna Bontemps (1902–1973)