Newton's method in optimization

In calculus, Newton's method (also called Newton–Raphson) is an iterative method for finding the roots of a differentiable function $f$, which are solutions to the equation $f(x)=0$. However, to optimize a twice-differentiable $f$, our goal is to find the roots of $f'$. We can therefore use Newton's method on its derivative $f'$ to find solutions to $f'(x)=0$, also known as the critical points of $f$. These solutions may be minima, maxima, or saddle points; see section "Several variables" in Critical point (mathematics) and also section "Geometric interpretation" in this article. This is relevant in optimization, which aims to find (global) minima of the function $f$.

Newton's method

The central problem of optimization is minimization of functions. Let us first consider the case of univariate functions, i.e., functions of a single real variable. We will later consider the more general and more practically useful multivariate case.

Given a twice differentiable function $f:\mathbb\to \mathbb$, we seek to solve the optimization problem
:$\min_ f(x) .$

Newton's method attempts to solve this problem by constructing a sequence $\$ from an initial guess (starting point) $x_0\in \mathbb$ that converges towards a minimizer $x_*$ of $f$ by using a sequence of second-order Taylor approximations of $f$ around the iterates. The second-order Taylor expansion of around $x_k$ is

:$f(x_k + t) \approx f(x_k) + f'(x_k) t + \frac f''(x_k) t^2.$

The next iterate $x_$ is defined so as to minimize this quadratic approximation in $t$, and setting $x_=x_k + t$. If the second derivative is positive, the quadratic approximation is a convex function of $t$, and its minimum can be found by setting the derivative to zero. Since

:$\displaystyle 0 = \frac \left(f(x_k) + f'(x_k) t + \frac 1 2 f''(x_k) t^2\right) = f'(x_k) + f'' (x_k) t,$
the minimum is achieved for
:$t = -\frac .$
Putting everything together, Newton's method performs the iteration
:$x_ = x_k + t = x_k - \frac.$

Geometric interpretation

The geometric interpretation of Newton's method is that at each iteration, it amounts to the fitting of a parabola to the graph of $f(x)$ at the trial value $x_k$, having the same slope and curvature as the graph at that point, and then proceeding to the maximum or minimum of that parabola (in higher dimensions, this may also be a saddle point), see below. Note that if $f$ happens to a quadratic function, then the exact extremum is found in one step.

Higher dimensions

The above iterative scheme can be generalized to $d>1$ dimensions by replacing the derivative with the gradient (different authors use different notation for the gradient, including $f'(x) = \nabla f(x) = g_f(x)\in \mathbb^d$), and the reciprocal of the second derivative with the inverse of the Hessian matrix (different authors use different notation for the Hessian, including $f''(x) = \nabla^2 f(x) = H_f(x)\in \mathbb^$). One thus obtains the iterative scheme

:x_ = x_k - ''(x_k) f'(x_k), \qquad k \ge 0.

Often Newton's method is modified to include a small step size $0 < \gamma \le 1$ instead of $\gamma=1$:
:x_ = x_k - \gamma ''(x_k) f' (x_k).
This is often done to ensure that the Wolfe conditions, or much simpler and efficient Armijo's condition, are satisfied at each step of the method. For step sizes other than 1, the method is often referred to as the relaxed or damped Newton's method.

Convergence

If is a strongly convex function with Lipschitz Hessian, then provided that $x_0$ is close enough to $x_*=\arg \min f(x)$, the sequence $x_0, x_1, x_2, \dots$ generated by Newton's method will converge to the (necessarily unique) minimizer $x_*$ of $f$ quadratically fast. That is,
:$\, x_-x_*\, \leq \frac \, x_-x_*\, ^2, \qquad \forall k\geq 0.$

Computing the Newton direction

Finding the inverse of the Hessian in high dimensions to compute the Newton direction $h = - (f''(x_k))^ f'(x_k)$ can be an expensive operation. In such cases, instead of directly inverting the Hessian, it is better to calculate the vector $h$ as the solution to the system of linear equations

: ''(x_k)h = - f'(x_k)

which may be solved by various factorizations or approximately (but to great accuracy) using iterative methods. Many of these methods are only applicable to certain types of equations, for example the Cholesky factorization and conjugate gradient will only work if $f''(x_k)$ is a positive definite matrix. While this may seem like a limitation, it is often a useful indicator of something gone wrong; for example if a minimization problem is being approached and $f''(x_k)$ is not positive definite, then the iterations are converging to a saddle point and not a minimum.

On the other hand, if a constrained optimization is done (for example, with Lagrange multipliers), the problem may become one of saddle point finding, in which case the Hessian will be symmetric indefinite and the solution of $x_$ will need to be done with a method that will work for such, such as the $LDL^\top$ variant of Cholesky factorization or the conjugate residual method.

There also exist various quasi-Newton methods, where an approximation for the Hessian (or its inverse directly) is built up from changes in the gradient.

If the Hessian is close to a non-invertible matrix, the inverted Hessian can be numerically unstable and the solution may diverge. In this case, certain workarounds have been tried in the past, which have varied success with certain problems. One can, for example, modify the Hessian by adding a correction matrix $B_k$ so as to make $f''(x_k) + B_k$ positive definite. One approach is to diagonalize the Hessian and choose $B_k$ so that $f''(x_k) + B_k$ has the same eigenvectors as the Hessian, but with each negative eigenvalue replaced by $\epsilon>0$.

An approach exploited in the Levenberg–Marquardt algorithm (which uses an approximate Hessian) is to add a scaled identity matrix to the Hessian, $\mu I$, with the scale adjusted at every iteration as needed. For large $\mu$ and small Hessian, the iterations will behave like gradient descent with step size $1/\mu$. This results in slower but more reliable convergence where the Hessian doesn't provide useful information.

Some caveats

Newton's method, in its original version, has several caveats:

# It does not work if the Hessian is not invertible. This is clear from the very definition of Newton's method, which requires taking the inverse of the Hessian.
# It may not converge at all, but can enter a cycle having more than 1 point. See the .
# It can converge to a saddle point instead of to a local minimum, see the section " Geometric interpretation" in this article.

The popular modifications of Newton's method, such as quasi-Newton methods or Levenberg-Marquardt algorithm mentioned above, also have caveats:

For example, it is usually required that the cost function is (strongly) convex and the Hessian is globally bounded or Lipschitz continuous, for example this is mentioned in the section "Convergence" in this article. If one looks at the papers by Levenberg and Marquardt in the reference for Levenberg–Marquardt algorithm, which are the original sources for the mentioned method, one can see that there is basically no theoretical analysis in the paper by Levenberg, while the paper by Marquardt only analyses a local situation and does not prove a global convergence result. One can compare with Backtracking line search method for Gradient descent, which has good theoretical guarantee under more general assumptions, and can be implemented and works well in practical large scale problems such as Deep Neural Networks.

See also

* Quasi-Newton method
*Gradient descent
* Gauss–Newton algorithm
* Levenberg–Marquardt algorithm
* Trust region
*Optimization
* Nelder–Mead method
* Self-concordant function - a function for which Newton's method has very good global convergence rate.

Notes

References

*
*
*
*
*
*

External links

*

{{DEFAULTSORT:Newton's Method In Optimization
Optimization algorithms and methods

fr:Méthode de Newton