A MODIFIED REGULARIZED NEWTON METHOD FOR UNCONSTRAINED NONCONVEX OPTIMIZATION
Heng Wang, Mei Qin, Haibo Wang
Abstract
Heng Wang, Mei Qin, Haibo Wang
Abstract
In this paper, we present a modified regularized Newton method for the unconstrained nonconvex optimization by using trust region technique. We show that if the gradient and Hessian of the objective function are Lipschitz continuous, then the modified regularized Newton method (M-RNM) has a global convergence property. Numerical results show that the algorithm is very efficient.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we present a modified regularized Newton method for the unconstrained nonconvex optimization by using trust region technique. We show that if the gradient and Hessian of the objective function are Lipschitz continuous, then the modified regularized Newton method (M-RNM) has a global convergence property. Numerical results show that the algorithm is very efficient.
Key concepts: Hessian matrix, Lipschitz continuity, Quasi-Newton method, Newton's method, Convergence (economics), Mathematics, Newton's method in optimization, Applied mathematics