For an unconstrained differentiable function of two real variables, an interior local minimum must solve the simultaneous stationary point equations
Apply Newton's method in optimization to this gradient equation. The Jacobian matrix of the gradient is the Hessian matrix
At , solve the linear system , then set . When the Hessian matrix is invertible, this is
This follows by setting the first order Taylor expansion equal to zero. Solving the linear system avoids explicitly computing a matrix inverse. A stationary point need not be a local minimum: for example, a positive-definite matrix suffices to classify a stationary point as a strict local minimum, whereas an indefinite Hessian matrix identifies a saddle point of a scalar function.
Expanding and taking partial derivatives gives the gradient and Hessian matrix
At , these are and
Thus the Newton step solves
The second equation gives ; substituting into the first gives . Hence
At , however,
The eigenvalues of this Hessian matrix are in direction and in direction . It is invertible but indefinite. Thus the Newton step is zero, and
This illustrates that stationary points are fixed points of Newton's method. Here the fixed point is a saddle point of a scalar function, not a local minimum. Indeed, direct substitution along the two eigenvector directions gives
For sufficiently small nonzero , one direction decreases and the other increases it. The global minimum is instead zero: the sum of squares vanishes at and . These are the only real zeros, since and imply . Thus a zero gradient is an insufficient stopping certificate for minimization problem without classifying the stationary point.

Articles by others on the same topic (0)

There are currently no matching articles.