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

DOI10.1007/s10107-015-0913-2zbMath1346.90665OpenAlexW599326068WikidataQ58185649 ScholiaQ58185649MaRDI QIDQ304219

Florian Jarre, Phillipe L. Toint

Publication date: 25 August 2016

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-015-0913-2

zbMATH Keywords

Newton's methodconvex minimizationline searchWolfe conditions

Mathematics Subject Classification ID

Convex programming (90C25) Newton-type methods (49M15)

Related Items (4)

On Newton's method for the Fermat-Weber location problem ⋮ On iterative algorithm and perturbation analysis for the nonlinear matrix equation ⋮ Regularized Newton Method with Global \({\boldsymbol{\mathcal{O}(1/{k}^2)}}\) Convergence ⋮ Optimal Transport Approximation of 2-Dimensional Measures

Cites Work

• On the convergence of Newton iterations to non-stationary points
• Newton's iterates can converge to non-stationary points
• Convergence of the Iterates of Descent Methods for Analytic Cost Functions
• Unnamed Item

This page was built for publication: Simple examples for the failure of Newton's method with line search for strictly convex minimization