Golden-section search
= Golden-section search
An <optimization> <algorithm> that brackets an extremum of a unimodal <function> on an <interval>. Two interior probes divide the bracket in the golden ratio; after discarding one side, one probe can be reused, so each subsequent contraction needs only one new <function> evaluation.