A New Modified Trust Region Algorithm for Solving Unconstrained Optimization Problems

Iterative methods for optimization can be classified into two categories: line search methods and trust region methods. in this paper, we propose a modified regularized newton method for minimizing nonconvex functions whose hessian matrix may be singular without line search. the proposed method is proved to converge globally if the gradient and hessian of the objective function are lipschitz continuous. moreover, we report numerical results that show that the proposed algorithm is competitive with the existing methods