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:
“There’s a theory, one I find persuasive, that the quest for knowledge is, at bottom, the search for the answer to the question: “Where was I before I was born.” In the beginning was ... what? Perhaps, in the beginning, there was a curious room, a room like this one, crammed with wonders; and now the room and all it contains are forbidden you, although it was made just for you, had been prepared for you since time began, and you will spend all your life trying to remember it.”
—Angela Carter (1940–1992)