ISSN:
1573-2878
Schlagwort(e):
Nonmonotone conjugate gradient method
;
nonmonotone line search
;
global convergence
;
unconstrained optimization
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Mathematik
Notizen:
Abstract In this paper, we introduce a class of nonmonotone conjugate gradient methods, which include the well-known Polak–Ribière method and Hestenes–Stiefel method as special cases. This class of nonmonotone conjugate gradient methods is proved to be globally convergent when it is applied to solve unconstrained optimization problems with convex objective functions. Numerical experiments show that the nonmonotone Polak–Ribière method and Hestenes–Stiefel method in this nonmonotone conjugate gradient class are competitive vis-à-vis their monotone counterparts.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1023/A:1021723128049
Permalink
