Golden-section search technique

A similar approach is used in the Golden Section Search Technique which uses as its basis a symmetrical placement of search points located at an arbitrary distance from each side of the search area.t This method can eliminate 99.9... 

Glass pipe and fittings, cost of, 505-506 Golden-section search technique, 406-407... 

Indirect methods solve the necessary conditions for an optimum (looking at the shape of the function) directly via iteration. Region elimination techniques such as Fibonacci and Golden Section searches use function evaluations only to delete a portion of the independent variable range at each iteration. Interpolation techniques use polynomial fitting (quadratic or cubic oftentimes) to predict the location of the optimum. 

The nature of the relationships and constraints in most design problems is such that the use of analytical methods is not feasible. In these circumstances search methods, that require only that the objective function can be computed from arbitrary values of the independent variables, are used. For single variable problems, where the objective function is unimodal, the simplest approach is to calculate the value of the objective function at uniformly spaced values of the variable until a maximum (or minimum) value is obtained. Though this method is not the most efficient, it will not require excessive computing time for simple problems. Several more efficient search techniques have been developed, such as the method of the golden section see Boas (1963b) and Edgar and Himmelblau (2001). 

An example of a line search technique that does not use derivatives is the golden section method, which seeks to find the minimum of a function /(x) on an interval [a, d. The interval [a, d is called... 

Unconstrained optimization (nonlinear programming), 2546-2553 classictil methods, 2546-2547 conjugate gradient methods, 2552-2553 golden section method, 2547-2549 line search techniques for, 2547 multidimensional search techniques for, 2549-2552... 

---