A new three-term conjugate gradient method
β Scribed by L. C. W. Dixon; P. G. Ducksbury; P. Singh
- Publisher
- Springer
- Year
- 1985
- Tongue
- English
- Weight
- 799 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0022-3239
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper we develop a new class of conjugate gradient methods for unconstrained optimization problems. A new nonmonotone line search technique is proposed to guarantee the global convergence of these conjugate gradient methods under some mild conditions. In particular, Polak-RibiΓ©re-Polyak and
Consider any conjugate gradient method for finding a zero point of a given gradient whose function is implicit. We propose two different types of conditions for selecting the step length using the gradient information only. One is used for re-proving known convergence results under the same gradient
In this paper, a new spectral PRP conjugate gradient algorithm has been developed for solving unconstrained optimization problems, where the search direction was a kind of combination of the gradient and the obtained direction, and the steplength was obtained by the Wolfe-type inexact line search. I