In this paper, we propose a new trust region method for unconstrained optimization
problems. The new trust region method can automatically adjust the trust region radius of
related subproblems at each iteration and has strong global convergence under some mild
conditions. We also analyze the global linear convergence, local superlinear and quadratic
convergence rate of the new method. Numerical results show that the new trust region
method is available and efficient in practical computation.