The global convergence properties of a conjugate gradient method
| Format: | Restricted Document |
|---|
| _version_ | 1860799613453205504 |
|---|---|
| building | INTELEK Repository |
| collection | Online Access |
| collectionurl | https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072 |
| date | 2014-08-04 10:30:26 |
| eventvenue | Kuala Lumpur, Malaysia |
| format | Restricted Document |
| id | 6691 |
| institution | UniSZA |
| originalfilename | 0366-01-FH03-FIK-15-02451.jpg |
| person | UniSZA Unisza unisza |
| recordtype | oai_dc |
| resourceurl | https://intelek.unisza.edu.my/intelek/pages/view.php?ref=6691 |
| spelling | 6691 https://intelek.unisza.edu.my/intelek/pages/view.php?ref=6691 https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072 Restricted Document Conference Conference Paper UniSZA Unisza unisza image/jpeg inches 96 96 1423 2014-08-04 10:30:26 752 1423x752 94 94 0366-01-FH03-FIK-15-02451.jpg UniSZA Private Access 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 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. 3rd ICMS 2013 Kuala Lumpur, Malaysia |
| spellingShingle | The global convergence properties of a conjugate gradient method |
| 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. |
| title | The global convergence properties of a conjugate gradient method |
| title_full | The global convergence properties of a conjugate gradient method |
| title_fullStr | The global convergence properties of a conjugate gradient method |
| title_full_unstemmed | The global convergence properties of a conjugate gradient method |
| title_short | The global convergence properties of a conjugate gradient method |
| title_sort | global convergence properties of a conjugate gradient method |