Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

The convergence of broyden algorithms for LC gradient function

The convergence of broyden algorithms for LC gradient function 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 superlinearly convergent. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Mathematicae Applicatae Sinica Springer Journals

The convergence of broyden algorithms for LC gradient function

Acta Mathematicae Applicatae Sinica , Volume 16 (3) – Jul 18, 2007

Loading next page...
 
/lp/springer-journals/the-convergence-of-broyden-algorithms-for-lc-gradient-function-wmv6vNoZ00

References (12)

Publisher
Springer Journals
Copyright
Copyright © 2000 by Science Press
Subject
Mathematics; Applications of Mathematics; Math Applications in Computer Science; Theoretical, Mathematical and Computational Physics
ISSN
0168-9673
eISSN
1618-3932
DOI
10.1007/BF02679896
Publisher site
See Article on Publisher Site

Abstract

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 superlinearly convergent.

Journal

Acta Mathematicae Applicatae SinicaSpringer Journals

Published: Jul 18, 2007

There are no references for this article.