摘要

In this paper, a new filter trust region algorithm is proposed for solving unconstrained nonlinear optimization problems. It modifies the retrospective ratio to a convex combined ratio for updating the trust-region radius. Moreover we use the filter technique to relax the acceptance of the trial point. The new algorithm is shown to be globally convergent to a first-order critical point. Numerical experiments on CUTEr problems indicate that the new algorithm is competitive.