full
search.png

Search

close.png

Cancel

arrow
Volume 22, Issue 1
A Class of Revised Broyden Algorithms Without Exact Line Search

Dingguo Pu, Shenghua Gui & Weiwen Tian

J. Comp. Math., 22 (2004), pp. 11-20.

Published online: 2004-02

Preview Full PDF 3006 26807

Cited by

google scholar semantic scholar
Export citation
  • Abstract

In this paper, we discuss the convergence of the Broyden algorithms with revised search direction. Under some inexact line searches, we prove that the algorithms are globally convergent for continuously differentiable functions and the rate of local convergence of the algorithms is one-step superlinear and n-step second-order for uniformly convex objective functions.

  • Keywords

Variable metric algorithms, Line search, Convergence, Convergence rate.

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-22-11, author = {Pu , DingguoGui , Shenghua and Tian , Weiwen}, title = {A Class of Revised Broyden Algorithms Without Exact Line Search}, journal = {Journal of Computational Mathematics}, year = {2004}, volume = {22}, number = {1}, pages = {11--20}, abstract = {

In this paper, we discuss the convergence of the Broyden algorithms with revised search direction. Under some inexact line searches, we prove that the algorithms are globally convergent for continuously differentiable functions and the rate of local convergence of the algorithms is one-step superlinear and n-step second-order for uniformly convex objective functions.

}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/8847.html} }
TY - JOUR T1 - A Class of Revised Broyden Algorithms Without Exact Line Search AU - Pu , Dingguo AU - Gui , Shenghua AU - Tian , Weiwen JO - Journal of Computational Mathematics VL - 1 SP - 11 EP - 20 PY - 2004 DA - 2004/02 SN - 22 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/8847.html KW - Variable metric algorithms, Line search, Convergence, Convergence rate. AB -

In this paper, we discuss the convergence of the Broyden algorithms with revised search direction. Under some inexact line searches, we prove that the algorithms are globally convergent for continuously differentiable functions and the rate of local convergence of the algorithms is one-step superlinear and n-step second-order for uniformly convex objective functions.

Pu , DingguoGui , Shenghua and Tian , Weiwen. (2004). A Class of Revised Broyden Algorithms Without Exact Line Search. Journal of Computational Mathematics. 22 (1). 11-20. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard