Preprint
Jul 2026
New Globalized Newton-Type Methods for Nonconvex Optimization Problems
This paper proposes a general line-search Newton framework for unconstrained optimization that avoids repeated Hessian regularization by exploiting the Newton direction only when it is well-defined and suitable and provides the first Newton-type algorithm together with a comprehensive convergence analysis for this important class of nonconvex optimization problems.
Vo Thanh Phat, Tuyen Tran
· 0 citations