A modified conjugate gradient coefficient under exact line search for unconstrained optimization
The conjugate gradient (CG) method is a well-known solver for large-scale unconstrained optimization problems. In this paper, a modified CG method based on AMR* and CD method is presented. The resulting algorithm for the new CG method is proved to be globally convergent under exact line search both...
| Published in: | International Journal of Engineering and Technology(UAE) |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
Science Publishing Corporation Inc
2018
|
| Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85076105320&partnerID=40&md5=74856ca33d2f1cec66a970563a029a62 |
| id |
2-s2.0-85076105320 |
|---|---|
| spelling |
2-s2.0-85076105320 'Aini N.; Hajar N.; Rivaie M.; Mamat M. A modified conjugate gradient coefficient under exact line search for unconstrained optimization 2018 International Journal of Engineering and Technology(UAE) 7 3.28 Special Issue 28 https://www.scopus.com/inward/record.uri?eid=2-s2.0-85076105320&partnerID=40&md5=74856ca33d2f1cec66a970563a029a62 The conjugate gradient (CG) method is a well-known solver for large-scale unconstrained optimization problems. In this paper, a modified CG method based on AMR* and CD method is presented. The resulting algorithm for the new CG method is proved to be globally convergent under exact line search both under some mild conditions. Comparisons of numerical performance are made involving the new method and four other CG methods. The results show that the proposed method is more efficient. © 2018 Authors. Science Publishing Corporation Inc 2227524X English Article |
| author |
'Aini N.; Hajar N.; Rivaie M.; Mamat M. |
| spellingShingle |
'Aini N.; Hajar N.; Rivaie M.; Mamat M. A modified conjugate gradient coefficient under exact line search for unconstrained optimization |
| author_facet |
'Aini N.; Hajar N.; Rivaie M.; Mamat M. |
| author_sort |
'Aini N.; Hajar N.; Rivaie M.; Mamat M. |
| title |
A modified conjugate gradient coefficient under exact line search for unconstrained optimization |
| title_short |
A modified conjugate gradient coefficient under exact line search for unconstrained optimization |
| title_full |
A modified conjugate gradient coefficient under exact line search for unconstrained optimization |
| title_fullStr |
A modified conjugate gradient coefficient under exact line search for unconstrained optimization |
| title_full_unstemmed |
A modified conjugate gradient coefficient under exact line search for unconstrained optimization |
| title_sort |
A modified conjugate gradient coefficient under exact line search for unconstrained optimization |
| publishDate |
2018 |
| container_title |
International Journal of Engineering and Technology(UAE) |
| container_volume |
7 |
| container_issue |
3.28 Special Issue 28 |
| doi_str_mv |
|
| url |
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85076105320&partnerID=40&md5=74856ca33d2f1cec66a970563a029a62 |
| description |
The conjugate gradient (CG) method is a well-known solver for large-scale unconstrained optimization problems. In this paper, a modified CG method based on AMR* and CD method is presented. The resulting algorithm for the new CG method is proved to be globally convergent under exact line search both under some mild conditions. Comparisons of numerical performance are made involving the new method and four other CG methods. The results show that the proposed method is more efficient. © 2018 Authors. |
| publisher |
Science Publishing Corporation Inc |
| issn |
2227524X |
| language |
English |
| format |
Article |
| accesstype |
|
| record_format |
scopus |
| collection |
Scopus |
| _version_ |
1809677907192184832 |