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...
保存先:
| 第一著者: | |
|---|---|
| フォーマット: | 学位論文 |
| 言語: | 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. |
|---|