A modifications of conjugate gradient method for unconstrained optimization problems
The Conjugate Gradient (CG) methods play an important role in solving large-scale unconstrained optimization problems. Several studies have been recently devoted to improving and modifying these methods in relation to efficiency and robustness. In this paper, a new parameter of CG method has been pr...
| 出版年: | International Journal of Engineering and Technology(UAE) |
|---|---|
| 第一著者: | |
| フォーマット: | 論文 |
| 言語: | English |
| 出版事項: |
Science Publishing Corporation Inc
2018
|
| オンライン･アクセス: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85045397706&doi=10.14419%2fijet.v7i2.14.11146&partnerID=40&md5=2149691b992d92af107809818ee076bd |
| id |
Alshorman O.; Mamat M.; Alhawarat A.; Revaie M. |
|---|---|
| spelling |
Alshorman O.; Mamat M.; Alhawarat A.; Revaie M. 2-s2.0-85045397706 A modifications of conjugate gradient method for unconstrained optimization problems 2018 International Journal of Engineering and Technology(UAE) 7 2 10.14419/ijet.v7i2.14.11146 https://www.scopus.com/inward/record.uri?eid=2-s2.0-85045397706&doi=10.14419%2fijet.v7i2.14.11146&partnerID=40&md5=2149691b992d92af107809818ee076bd The Conjugate Gradient (CG) methods play an important role in solving large-scale unconstrained optimization problems. Several studies have been recently devoted to improving and modifying these methods in relation to efficiency and robustness. In this paper, a new parameter of CG method has been proposed. The new parameter possesses global convergence properties under the Strong Wolfe-Powell (SWP) line search. The numerical results show that the proposed formula is more efficient and robust compared with Polak-Rribiere Ployak (PRP), Fletcher-Reeves (FR) and Wei, Yao, and Liu (WYL) parameters. © 2018 Authors. Science Publishing Corporation Inc 2227524X English Article All Open Access; Bronze Open Access |
| author |
2-s2.0-85045397706 |
| spellingShingle |
2-s2.0-85045397706 A modifications of conjugate gradient method for unconstrained optimization problems |
| author_facet |
2-s2.0-85045397706 |
| author_sort |
2-s2.0-85045397706 |
| title |
A modifications of conjugate gradient method for unconstrained optimization problems |
| title_short |
A modifications of conjugate gradient method for unconstrained optimization problems |
| title_full |
A modifications of conjugate gradient method for unconstrained optimization problems |
| title_fullStr |
A modifications of conjugate gradient method for unconstrained optimization problems |
| title_full_unstemmed |
A modifications of conjugate gradient method for unconstrained optimization problems |
| title_sort |
A modifications of conjugate gradient method for unconstrained optimization problems |
| publishDate |
2018 |
| container_title |
International Journal of Engineering and Technology(UAE) |
| container_volume |
7 |
| container_issue |
2 |
| doi_str_mv |
10.14419/ijet.v7i2.14.11146 |
| url |
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85045397706&doi=10.14419%2fijet.v7i2.14.11146&partnerID=40&md5=2149691b992d92af107809818ee076bd |
| description |
The Conjugate Gradient (CG) methods play an important role in solving large-scale unconstrained optimization problems. Several studies have been recently devoted to improving and modifying these methods in relation to efficiency and robustness. In this paper, a new parameter of CG method has been proposed. The new parameter possesses global convergence properties under the Strong Wolfe-Powell (SWP) line search. The numerical results show that the proposed formula is more efficient and robust compared with Polak-Rribiere Ployak (PRP), Fletcher-Reeves (FR) and Wei, Yao, and Liu (WYL) parameters. © 2018 Authors. |
| publisher |
Science Publishing Corporation Inc |
| issn |
2227524X |
| language |
English |
| format |
Article |
| accesstype |
All Open Access; Bronze Open Access |
| record_format |
scopus |
| collection |
Scopus |
| _version_ |
1828987878682656768 |