| By using a modified BFGS update, a globally convergent BFGS-type trust region method was proposed for unconstrained optimization problems in this paper. A favorable property of this method is that the trust region subproblem is always a strictly convex quadratic programming. Moreover, this property is independent of the convexity of the objective function. Under certain conditions, the superlinear convergence of this method was established. Preliminary numerical results have been presented, which show that the modified method is efficient. |
|
|