For a twice continuously differentiable real function, define the Newton map in optimization wherever its Hessian matrix is invertible. Every stationary point in this domain is a fixed point, because its gradient is zero. This includes a local maximum and a saddle point of a scalar function, as well as a local minimum. Thus Newton's method in optimization needs a separate minimum classification or a method for ensuring descent when it is used for minimization problem.
For example, has a stationary point at , with Hessian matrixIts eigenvalues are and , so it is a saddle point of a scalar function, but starting Newton's method in optimization there gives a constant sequence. Its value is , whereas the global minimum zero is attained at and .
Articles by others on the same topic
There are currently no matching articles.