This class provides implementation support for those univariate optimization algorithms that are based on bracketing.
Examples are Bisection method, Fibonacci search, and Golden-section search.
Starting with a 3-point bracketing interval of a minimum, i.e., xl, xa, xu,
the search iteratively reduce the length of the interval.
It computes a 4th point, xb, according to an interval dividing schedule, to form two overlapping sub-intervals, e.g.,
[xl, xa], and
The sub-interval that contains the new minimum is chosen. Repeat the procedure until convergence.
This algorithm is most effective for a uni-modal function in interval
"Andreas Antoniou and Wu-Sheng Lu, "Chapter 4," Practical Optimization: Algorithms and Engineering Applications. Springer."