A gradient-based globalization strategy for the Newton method

DOI10.1007/978-3-030-39081-5_16OpenAlexW3006477280MaRDI QIDQ2200337FDOQ2200337

Authors: D. di Serafino, Gerardo Toraldo, Marco Viola 

Publication date: 21 September 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-39081-5_16

zbMATH Keywords

global convergencegradient methodNewton method

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cited In (3)

• Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming
• Using gradient directions to get global convergence of Newton-type methods
• LSOS: Line-search second-order stochastic optimization methods for nonconvex finite sums

This page was built for publication: A gradient-based globalization strategy for the Newton method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200337)