| _version_ |
1860796895382732800
|
| building |
INTELEK Repository
|
| collection |
Online Access
|
| collectionurl |
https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072
|
| date |
2020-12-06 01:35:15
|
| format |
Restricted Document
|
| id |
10592
|
| institution |
UniSZA
|
| originalfilename |
4635-01-FH05-FIK-20-47857.pdf
|
| person |
Mozilla/5.0 (Windows NT 6.1; Win64; x64) AppleWebKit/537.36 (KHTML
like Gecko) Chrome/86.0.4240.198 Safari/537.36
|
| recordtype |
oai_dc
|
| resourceurl |
https://intelek.unisza.edu.my/intelek/pages/view.php?ref=10592
|
| spelling |
10592 https://intelek.unisza.edu.my/intelek/pages/view.php?ref=10592 https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072 Restricted Document Book Chapter application/pdf 5 1.6 Mozilla/5.0 (Windows NT 6.1; Win64; x64) AppleWebKit/537.36 (KHTML Skia/PDF m86 like Gecko) Chrome/86.0.4240.198 Safari/537.36 2020-12-06 01:35:15 4635-01-FH05-FIK-20-47857.pdf UniSZA Private Access An Efficient Hybrid Conjugate Gradient Method for Unconstrained Optimisation Optimisation refers to a common procedure applied within the science and engineering domain to determine variables that produce the best performance values. One of the common efficient techniques to solve large-scale unconstrained optimisation issues is the conjugate gradient method, because of its simplicity, low memory consumptions and global convergence properties. This method embeds the n-step to attain a minimum point, where convergence properties are absent. Several techniques do not perform well according to the number of iteration and CPU time. In order to address these shortcomings, this study proposed new Hybrid CG coefficients, β , Tal’at and Mamat (HTM). The proposed parameter βkHTM is computed as a combination of βkHS (Hestenes–Steifel formula), βkLS (Liu–Storey formula) and βkRMIL (Rivaie formula) to exploit attractive features of each. The algorithm uses the exact line search. Numerical results and their performance profiles display that the proposed method is promising. It is also shown that’s the new formula for β performs much better than the original Hestenes–Steifel, Liu–Storey and the Rivaie methods. © 2020, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. Springer Springer 191-207 Forum for Interdisciplinary Mathematics
|
| spellingShingle |
An Efficient Hybrid Conjugate Gradient Method for Unconstrained Optimisation
|
| summary |
Optimisation refers to a common procedure applied within the science and engineering domain to determine variables that produce the best performance values. One of the common efficient techniques to solve large-scale unconstrained optimisation issues is the conjugate gradient method, because of its simplicity, low memory consumptions and global convergence properties. This method embeds the n-step to attain a minimum point, where convergence properties are absent. Several techniques do not perform well according to the number of iteration and CPU time. In order to address these shortcomings, this study proposed new Hybrid CG coefficients, β , Tal’at and Mamat (HTM). The proposed parameter βkHTM is computed as a combination of βkHS (Hestenes–Steifel formula), βkLS (Liu–Storey formula) and βkRMIL (Rivaie formula) to exploit attractive features of each. The algorithm uses the exact line search. Numerical results and their performance profiles display that the proposed method is promising. It is also shown that’s the new formula for β performs much better than the original Hestenes–Steifel, Liu–Storey and the Rivaie methods. © 2020, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
|
| title |
An Efficient Hybrid Conjugate Gradient Method for Unconstrained Optimisation
|
| title_full |
An Efficient Hybrid Conjugate Gradient Method for Unconstrained Optimisation
|
| title_fullStr |
An Efficient Hybrid Conjugate Gradient Method for Unconstrained Optimisation
|
| title_full_unstemmed |
An Efficient Hybrid Conjugate Gradient Method for Unconstrained Optimisation
|
| title_short |
An Efficient Hybrid Conjugate Gradient Method for Unconstrained Optimisation
|
| title_sort |
efficient hybrid conjugate gradient method for unconstrained optimisation
|