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)).
Read more about Golden Section Search: Basic Idea, Probe Point Selection, Termination Condition, Recursive Algorithm, Fibonacci Search
Famous quotes containing the words golden, section and/or search:
“I do not think that what is called Love at first sight is so great an absurdity as it is sometimes imagined to be. We generally make up our minds beforehand to the sort of person we should like, grave or gay, black, brown, or fair; with golden tresses or raven locks;—and when we meet with a complete example of the qualities we admire, the bargain is soon struck.”
—William Hazlitt (1778–1830)
“To look at the cross-section of any plan of a big city is to look at something like the section of a fibrous tumor.”
—Frank Lloyd Wright (1869–1959)
“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)