Abstract: This essay bases on Bunch-parlett factorization and changs the subproblem of trust region into its equivalent subproblem,thus result in an easier method to construct the gradient paths. The Hessian Matrix does not need to be and the merits of trust region methods are remained.It is obvious that gradient path search methods to solve trust region problems arising from unconstrained optimization problems is more proctical.