ABSTRACT
This chapter reviews the procedures that are the interval halving and golden section search methods. These two procedures can also be employed to obtain the solution to some equations. The chapter provides search procedures for interval halving method, bisection method, golden section method and method of steepest ascent/descent. The optimization search method reduces the interval of the location of the independent variable that contains the solution by one-half the previous interval. It has also been defined as the three-point equal-interval search method since it requires three equally spaced trial points in the search interval. A search procedure can be employed that is based on the interval halving method described below for optimizing a function. The method assumes the function is not only unimodal but also differentiable. All the one-independent variable search methods developed earlier presume a unimodal function.
