# Simple examples for the failure of Newton’s method with line search for strictly convex minimization

Florian Jarre, Philippe L. Toint

Résultats de recherche: Contribution à un journal/une revueArticleRevue par des pairs

## Résumé

In this paper two simple examples of a twice continuously differentiable strictly convex function (Formula presented.) are presented for which Newton’s method with line search converges to a point where the gradient of (Formula presented.) is not zero. The first example uses a line search based on the Wolfe conditions. For the second example, some strictly convex function (Formula presented.) is defined as well as a sequence of descent directions for which exact line searches do not converge to the minimizer of (Formula presented.). Then (Formula presented.) is perturbed such that these search directions coincide with the Newton directions for the perturbed function while leaving the exact line search invariant.

langue originale Anglais 23-34 Mathematical Programming 158 1 https://doi.org/10.1007/s10107-015-0913-2 Publié - juin 2016