A review of trust region algorithms for optimization

Abstract The classical methods for optimization are line search algorithms. Such an algorithm obtains a search direction in each iteration, and searches along this direction to obtain a better point. The search direction is a descent direction, normally computed by solving a subproblem that approximates the original optimization problem near the current iterate. Therefore, unless a stationary point is reached, there always exist better points along the search direction.