摘要
In this paper, we discuss the convergence of Broyden algorithms for the functions which are non-twice differentiable, but have LC gradient. We prove that the rate of convergence of the algorithms is linear for uniformly convex functions. We also demonstrate that under some mild conditions the algorithms are superlinsarly convergent.
In this paper, we discuss the convergence of Broyden algorithms for the functions which are non-twice differentiable, but have LC gradient. We prove that the rate of convergence of the algorithms is linear for uniformly convex functions. We also demonstrate that under some mild conditions the algorithms are superlinsarly convergent.