New conjugate gradient methods for solving large-scale unconstrained optimization problems
Conjugate gradient methods hold an important role in unconstrained optimizations. Numerous recent studies and modifications have been aimed to improve these methods. In this research, four modifications of the conjugate gradient coefficient (Bk ) are proposed in order to solve unconstrained optimiz...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 語言: | English |
| 出版: |
Terengganu: Universiti Malaysia Terengganu
2014
|
| 主題: | |
| 在線閱讀: | http://dspace.psnz.umt.edu.my/xmlui/handle/123456789/3033 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | Conjugate gradient methods hold an important role in unconstrained optimizations. Numerous recent studies and modifications have been aimed to improve these methods. In this research, four modifications of the conjugate gradient coefficient
(Bk ) are proposed in order to solve unconstrained optimization problems using exact line searches. |
|---|