| Article ID: | iaor20003783 |
| Country: | Singapore |
| Volume: | 14 |
| Issue: | 2 |
| Start Page Number: | 93 |
| End Page Number: | 109 |
| Publication Date: | Nov 1997 |
| Journal: | Asia-Pacific Journal of Operational Research |
| Authors: | Dingguo P.U., Tian Weiwen |
| Keywords: | programming: convex |
In this paper we discuss the convergence of the Broyden algorithms with revised search direction. We prove that the algorithms are globally convergent for continuously differentiable functions and the rate of convergence of the algorithms is one-step superlinear and