Year: 1994
Author: Ding-Guo Pu, Wei-Wen Tian
Journal of Computational Mathematics, Vol. 12 (1994), Iss. 4 : pp. 366–379
Abstract
In this paper we discuss the convergence of the modified Broyden algorithms. We prove that the algorithms are globally convergent for the continuous differentiable function and the rate of convergence of the algorithms is one-step superlinear and n-step second-order for the uniformly convex objective function. From the discussion of this paper, we may get some convergence properties of the Broyden algorithms.
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/1994-JCM-10219
Journal of Computational Mathematics, Vol. 12 (1994), Iss. 4 : pp. 366–379
Published online: 1994-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 14