A modified nonmonotone trust region line search method

Hybridizing monotone and nonmonotone approaches, we propose a modified trust region ratio in which more reasonable information is provided about consistency between the exact and the approximate models. Also, we employ an Armijo-type line search strategy to avoid resolving the trust region subproblem whenever a trial step is rejected. We show that the proposed algorithm can preserve global convergence of the traditional trust region algorithm as well as the superlinear convergence property. Numerical experiments are done on a set of unconstrained optimization test problems of the CUTEr library. They demonstrate practical efficiency of the proposed algorithm in the sense of the Dolan–Moré performance profile.