| Article ID: | iaor19981963 |
| Country: | China |
| Volume: | 10 |
| Issue: | 4 |
| Start Page Number: | 289 |
| End Page Number: | 298 |
| Publication Date: | Oct 1997 |
| Journal: | Journal of Systems Science and Complexity |
| Authors: | Pu D.G. |
In this paper, the author discusses the convergence of the Broyden algorithms without convexity and exact line search assumptions. He proves that if the objective function is suitably smooth and the algorithm produces a convergent point sequence, then the limit point of the sequence is a critical point of the objective function.