@Article{JCM-32-4,
author = {},
title = {A New Nonmonotone Trust Region Algorithm for Solving Unconstrained Optimization Problems},
journal = {Journal of Computational Mathematics},
year = {2014},
volume = {32},
number = {4},
pages = {476--490},
abstract = {<p style="text-align: justify;">Based on the nonmonotone line search technique proposed by Gu and Mo (Appl. Math. Comput. 55, (2008) pp. 2158-2172), a new nonmonotone trust region algorithm is proposed for solving unconstrained optimization problems in this paper. The new algorithm is developed by resetting the ratio $ρ_k$ for evaluating the trial step $d_k$ whenever acceptable. The global and superlinear convergence of the algorithm are proved under suitable conditions. Numerical results show that the new algorithm is effective for solving unconstrained optimization problems.</p>},
issn = {1991-7139},
doi = {https://doi.org/10.4208/jcm.1401-m3975},
url = {https://global-sci.com/article/84646/a-new-nonmonotone-trust-region-algorithm-for-solving-unconstrained-optimization-problems}
}