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:
“She came out on the stage in yards of pearls, emerging like
a favorite scenic view, flashed her golden smile and sang.”
—Robert Earl Hayden (1913–1980)
“Every man has been brought up with the idea that decent women don’t pop in and out of bed; he has always been told by his mother that “nice girls don’t.” He finds, of course, when he gets older that this may be untrue—but only in a certain section of society.”
—Barbara Cartland (b. 1901)
“I never found even in my juvenile hours that it was necessary to go a thousand miles in search of themes for moralizing.”
—Horace Walpole (1717–1797)