O'Reilly logo

An Introduction to Optimization, 4th Edition by Stanislaw H. Zak, Edwin K. P. Chong

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

CHAPTER 8

GRADIENT METHODS

8.1 Introduction

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 f(x) = c for some constant c. Thus, a point x0 n is on the level set corresponding to level c if f(x0) = c. In the case of functions of two real variables, f : 2, the notion of the level set is illustrated in Figure 8.1.

Figure 8.1 Constructing a level set corresponding to level c for f.

The gradient of f at x0, denoted ∇f(x0), if it is not a zero vector, is orthogonal to the tangent ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required