Year: 2003
Journal of Computational Mathematics, Vol. 21 (2003), Iss. 2 : pp. 229–236
Abstract
In this paper we propose a self-adaptive trust region algorithm. The trust region radius is updated at a variable rate according to the ratio between the actual reduction and the predicted reduction of the objective function, rather than by simply enlarging or reducing the original trust region radius at a constant rate. We show that this new algorithm preserves the strong convergence property of traditional trust region methods. Numerical results are also presented.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/2003-JCM-10277
Journal of Computational Mathematics, Vol. 21 (2003), Iss. 2 : pp. 229–236
Published online: 2003-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 8
Keywords: Trust region Unconstrained optimization Nonlinear optimization.