In this paper, we discuss the convergence of the Broyden algorithms withrevised search direction. Under some inexact line searches, we prove that the algorithms areglobally convergent for continuously differentiable f...In this paper, we discuss the convergence of the Broyden algorithms withrevised search direction. Under some inexact line searches, we prove that the algorithms areglobally convergent for continuously differentiable functions and the rate of convergence of thealgorithms is one-step superlinear and n-step second-order for uniformly convex objective functions.展开更多
基金This research is supported by Ministry of Education P. R. C.
文摘In this paper, we discuss the convergence of the Broyden algorithms withrevised search direction. Under some inexact line searches, we prove that the algorithms areglobally convergent for continuously differentiable functions and the rate of convergence of thealgorithms is one-step superlinear and n-step second-order for uniformly convex objective functions.
