Abstract.
In this paper we propose a nonmonotone trust region algorithm for optimization with simple bound constraints. Under mild conditions, we prove the global convergence of the algorithm. For the monotone case it is also proved that the correct active set can be identified in a finite number of iterations if the strict complementarity slackness condition holds, and so the proposed algorithm reduces finally to an unconstrained minimization method in a finite number of iterations, allowing a fast asymptotic rate of convergence. Numerical experiments show that the method is efficient.
Author information
Authors and Affiliations
Additional information
Accepted 5 September 2000. Online publication 4 December 2000.
Rights and permissions
About this article
Cite this article
-W. Chen, Z., -Y. Han, J. & -C. Xu, D. A Nonmonotone Trust Region Method for Nonlinear Programming with Simple Bound Constraints. Appl Math Optim 43, 63–85 (2001). https://doi.org/10.1007/s002450010020
Published:
Issue Date:
DOI: https://doi.org/10.1007/s002450010020