Year: 1995
Author: De-Tong Zhu
Journal of Computational Mathematics, Vol. 13 (1995), Iss. 1 : pp. 20–31
Abstract
In this paper, a nonmonotonic trust region method for optimization problems with equality constraints is proposed by introducing a nonsmooth merit function and adopting a correction step. It is proved that all accumulation points of the iterates generated by the proposed algorithm are Kuhn-Tucker points and that the algorithm is $q$-superlinearly convergent.
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/1995-JCM-9248
Journal of Computational Mathematics, Vol. 13 (1995), Iss. 1 : pp. 20–31
Published online: 1995-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 12