Use matlab code:

Numerical optimization An important problem in numerical computing is finding the minimum z of a function f(z). This is very much related to the root-finding problem. Indeed, if f is differentiable, then a minimum z" of f(r) is a zero of the derivative f'(z) Unfortunately, an approach based on applying the bisection method to f'(z) may not work, since the derivative values may not be available in practice. Fortunately, there is an algorithm similar to the bisection method can be used to find the minimum z using values of f(z) only Recall that the bisection method produces pairs of numbers [an, bol. For finding minima, we will instead produce a sequence of triples lan, ton, cn] that have the following bracketing property f(an) f(ton) and f(bon) f(cn) (0.1) Hence minimum r. the algorithm proceeds in the following way: 1. Choose a new point r using the formula: bn +r(cn-bn) if (cn bn) (bn an) bn +r(an -bn) if (cn -bn) (bn an) 2. Update the triple using the formula: lan, z bn] if z