Complexity of the Regularized Newton Method

zbMath1474.49059arXiv1706.08483MaRDI QIDQ5146232

Roman A. Polyak

Publication date: 25 January 2021

Full work available at URL: https://arxiv.org/abs/1706.08483

zbMATH Keywords

global convergencequadratic convergence rateregularized Newton's methodNewton's areaNewton's decrement

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Newton-type methods (49M15)

Related Items (2)

Computing the Conformal Barycenter ⋮ A parameter choice rule for Tikhonov regularization based on predictive risk

This page was built for publication: Complexity of the Regularized Newton Method