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:
“We are too civil to books. For a few golden sentences we will turn over and actually read a volume of four or five hundred pages.”
—Ralph Waldo Emerson (1803–1882)
“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)
“At any age we must cherish illusions, consolatory or merely pleasant; in youth, they are omnipresent; in old age we must search for them, or even invent them. But with all that, boredom is their natural and inevitable accompaniment.”
—Philip Dormer Stanhope, 4th Earl Chesterfield (1694–1773)