The global convergence properties of a conjugate gradient method
Conjugate gradient method are the most famous methods for solving nonlinear unconstrained optimization problems, especially large scale problems. That is, for its simplicity and low memory requirement. The strong Wolfe line search are usually used in practice for the analyses and implementations of...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | en |
| Published: |
2014
|
| Subjects: | |
| Online Access: | http://eprints.unisza.edu.my/366/1/FH03-FIK-15-02451.jpg http://eprints.unisza.edu.my/366/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Conjugate gradient method are the most famous methods for solving nonlinear unconstrained optimization problems, especially large scale problems. That is, for its simplicity and low memory requirement. The strong Wolfe line search are usually used in practice for the analyses and implementations of conjugate gradient methods. In this paper, we present a new method of nonlinear conjugate gradient method with strong Wolfe line search for unconstrained optimization problems. Under some assumptions, the sufficient descent property and the global convergence are given. The numerical results show that our new method is efficient for some unconstrained optimization problems. |
|---|