Brent's method for doing this is sometimes called inverse parabolic interpolation.  The Fletcher-Reeves algorithm and its superior cousin, the Polak-Ribiere algorithm, can also be used to do this, while the DFP and BFGS algorithms are examples of variable metric methods for doing this.  Powell's algorithm is the prototype for direction set methods of doing this.  This can also be done by annealing or through dynamic programming, whose "canonical problem" involves this.  The easiest ways of doing it computationally are the golden section search and the simplex method.  For 10 points, name this 
Brent's method for doing this is sometimes called inverse parabolic interpolation.  The Fletcher-Reeves algorithm and its superior cousin, the Polak-Ribiere algorithm, can also be used to do this, while the DFP and BFGS algorithms are examples of variable metric methods for doing this.  Powell's algorithm is the prototype for direction set methods of doing this.  This can also be done by annealing or through dynamic programming, whose "canonical problem" involves this.  The easiest ways of doing it computationally are the golden section search and the simplex method.  For 10 points, name this process which involves finding the highest or lowest point of a function.
Brent's method for doing this is sometimes called inverse parabolic interpolation.  
optimization (accept minimization until "highest" or maximization until "lowest")