The golden ratio

Noticing that

it follows that

Solving

An interval of uncertainty (during iteration k) is iteratively reduced in a way that if the original interval of uncertainty were to contain a single local optimum of the function , then so would all subsequent intervals of uncertainty , for any .

The GSS heuristic returns an estimate of the entire, sufficiently small interval of uncertainty which contains a local optimum of .

Worked Example

with the initial point interval

Step 1

The required number of search iterations is:

where .

Step 2

for :

Step 3

,

k
0010.381 966-0.618 034
1
2
3
4
5
15

The interval of uncertainty is replaced by a rectangle of uncertainty, denoted by which has corner points and .

Worked Example

with initial rectangle interval

Step 1