For a twice continuously differentiable function , its gradient and Hessian matrix are
A critical point solves . The Jacobian matrix of this vector equation is , so the multivariable Newton iteration is
Equivalently when the Hessian matrix is invertible. Solving the linear system is the direct computational form. A critical point found in this way need not be a local minimum; its type requires a separate check.
The gradient and constant Hessian matrix are
At , and . Hence one multivariable Newton iteration gives
At this point the gradient vanishes, so every subsequent iterate is . The one-step result follows because the gradient of a quadratic polynomial is affine and its linearization is exact. Since the leading principal minors of are and , it is a positive-definite matrix. Alternatively,
directly proves that is the unique global minimum, with value .

Articles by others on the same topic (0)

There are currently no matching articles.