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:
“Such is always the pursuit of knowledge. The celestial fruits, the golden apples of the Hesperides, are ever guarded by a hundred-headed dragon which never sleeps, so that it is an Herculean labor to pluck them.”
—Henry David Thoreau (1817–1862)
“Ah, Governor [Murphy, of New Jersey], don’t try to deceive me as to the sentiment of the dear people. I have been hearing from the West and the East, and the South seems to be the only section which approves of me at all, and that comes from merely a generous impulse, for even that section would deny me its votes.”
—William Howard Taft (1857–1930)
“It no longer makes sense to speak of “feeding problems” or “sleep problems” or “negative behavior” is if they were distinct categories, but to speak of “problems of development” and to search for the meaning of feeding and sleep disturbances or behavior disorders in the developmental phase which has produced them.”
—Selma H. Fraiberg (20th century)