The convergence of single-rank quasi-Newton methods

Analyses of the convergence properties of general quasi-Newton methods are presented, particular attention being paid to how the approximate solutions and the iteration matrices approach their final values. It is further shown that when Broyden’s algorithm is applied to linear systems, the error norms are majorised by a superlinearly convergent sequence of an unusual kind.