| Abstract: | An active-set projected trust region algorithm is proposed for box constrained optimization problems, where the given algorithm is designed by three steps. First, the projected gradient direction which normally has better numerical performance is introduced. Second, the projected trust region direction that often possesses good convergence is defined, where the matrix of trust region subproblem is updated by limited memory strategy. Third, in order to get both good numerical performance and convergence, the authors define the final search which is the convex combination of the projected gradient direction and the projected trust region direction. Under suitable conditions, the global convergence of the given algorithm is established. Numerical results show that the presented method is competitive to other similar methods. |
