In this chapter we consider a class of search methods for real-valued functions on ^{n}. These methods use the gradient of the given function. In our discussion we use such terms as *level sets, normal vectors*, and *tangent vectors.* These notions were discussed in some detail in Part I.

Recall that a level set of a function *f* : ^{n} → is the set of points ** x** satisfying

The gradient of *f* at *x*_{0}, denoted ∇*f*(*x*_{0}), if it is not a zero vector, is orthogonal to the tangent ...

Start Free Trial

No credit card required