Overview of Trust-region Methods


  • Xinyao Li




The Trust-region Technique, Performance Values, Quadratic Model


The trust-region technique is an optimization algorithm for solving multidimensional nonlinear optimization complications. It is a class of derivative-based optimization approaches that relies on information about the gradient of the objective function and possibly Hessians. The main idea behind the Trust-region method is to remodel the objective function around the present iteration Solution of the inner subproblem. The confidence region is the region around the present iteration where the model is expected to be accurate. At each iteration, the trust region technique uses a quadratic model to estimate the objective function locally (Yuan, 2019). This model is based on the current iteration and the information about the gradient and Hessian. The confidence region limits the distance the algorithm can take from the current iteration to find the next one. The size of the trust region is adjusted dynamically based on the arrangement between the model and the actual performance values.


Download data is not yet available.


Conn, A. R., Gould, N. I., & Toint, P. L. (2020). Trust region methods—society for Industrial and Applied Mathematics.

Yuan, Y. X. (2020). A review of trust region algorithms for optimization. In Iciam (Vol. 99, No. 1, pp. 271-282).

Yuan, Y. X. (2019). Recent advances in trust region algorithms. Mathematical Programming, pp. 151, 249–281.

Moré, J. J. (2020). Recent developments in algorithms and software for trust region methods (pp. 258–287). Springer Berlin Heidelberg.

Nocedal, J., & Wright, S. J. (2002). Trust-region methods. Numerical Optimization, 66-100.







How to Cite

Li, X. (2024). Overview of Trust-region Methods. Frontiers in Computing and Intelligent Systems, 8(3), 25-27. https://doi.org/10.54097/hbsy3w97