Source: wikibot/golden-section-search
= Golden-section search
{wiki=Golden-section_search}
The Golden-section search is an optimization algorithm used to find the maximum or minimum of a unimodal function (a function that has one local maximum or minimum within a given interval). It is particularly useful for optimizing functions that are continuous and differentiable in the specified interval. The method is based on the golden ratio, which is approximately 1.61803.