Numerical Research On The Sensitivity Of Nonmonotone Trust Region Algorithms To Their Parameters

摘要

In this paper, a numerical research on the sensitivity of nonmonotone trust region algorithms to their parameters is presented. We compare the numerical efficiency of two classes of nonmonotone trust region (NTR) algorithms in the context of unconstrained optimization. We examine the sensitivity of the algorithms to the parameters related to the nonmonotone technique and the initial trust region radius. We show that the numerical efficiency of nonmonotone trust region algorithms can be improved by choosing appropriate parameters. Based on extensive numerical tests, some efficient ranges of these parameters for nonmonotone trust region algorithms are recommended.