full
search.png

Search

close.png

Cancel

arrow
Volume 12, Issue 4
A Class of Modified Broyden Algorithms

Ding-Guo Pu & Wei-Wen Tian

J. Comp. Math., 12 (1994), pp. 366-379.

Published online: 1994-12

Preview Full PDF 2590 26021

Cited by

google scholar semantic scholar
Export citation
  • 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.

  • Keywords

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-12-366, author = {Pu , Ding-Guo and Tian , Wei-Wen}, title = {A Class of Modified Broyden Algorithms}, journal = {Journal of Computational Mathematics}, year = {1994}, volume = {12}, number = {4}, pages = {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.

}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/10219.html} }
TY - JOUR T1 - A Class of Modified Broyden Algorithms AU - Pu , Ding-Guo AU - Tian , Wei-Wen JO - Journal of Computational Mathematics VL - 4 SP - 366 EP - 379 PY - 1994 DA - 1994/12 SN - 12 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/10219.html KW - AB -

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.

Pu , Ding-Guo and Tian , Wei-Wen. (1994). A Class of Modified Broyden Algorithms. Journal of Computational Mathematics. 12 (4). 366-379. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard