| _version_ |
1860797371815821312
|
| building |
INTELEK Repository
|
| collection |
Online Access
|
| collectionurl |
https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072
|
| date |
2019-06-30 22:19:10
|
| format |
Restricted Document
|
| id |
12450
|
| institution |
UniSZA
|
| originalfilename |
6753-01-FH02-FIK-20-47982.pdf
|
| person |
uniszai7-user
|
| recordtype |
oai_dc
|
| resourceurl |
https://intelek.unisza.edu.my/intelek/pages/view.php?ref=12450
|
| spelling |
12450 https://intelek.unisza.edu.my/intelek/pages/view.php?ref=12450 https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072 Restricted Document Article Journal application/pdf 9 Adobe Acrobat Pro DC 20 Paper Capture Plug-in 1.7 uniszai7-user 2019-06-30 22:19:10 6753-01-FH02-FIK-20-47982.pdf UniSZA Private Access A combination of FR and HS coefficient in conjugate gradient method for unconstrained optimization Malaysian Journal of Computing and Applied Mathematics The conjugate gradient (CG) method is one of the most popular methods for solving large-scale problems of unconstrained optimization. In this paper, a new CG method based on combination of two classical CG methods of Fletcher-Reeves (FR), and Hestence-Stiefel (HS) is proposed. This method possess the global convergence properties and the sufficient descent condition. The tests of the new CG method by using MATLAB are measured in terms of central processing unit (CPU) time and iteration numbers with strong Wolfe-Powell inexact line search. Results presented have shown that the new CG method performs better compare to other CG methods. 2 1 42-50
|
| spellingShingle |
A combination of FR and HS coefficient in conjugate gradient method for unconstrained optimization
|
| summary |
The conjugate gradient (CG) method is one of the most popular methods for solving large-scale problems of unconstrained optimization. In this paper, a new CG method based on combination of two classical CG methods of Fletcher-Reeves (FR), and Hestence-Stiefel (HS) is proposed. This method possess the global convergence properties and the sufficient descent condition. The tests of the new CG method by using MATLAB are measured in terms of central processing unit (CPU) time and iteration numbers with strong Wolfe-Powell inexact line search. Results presented have shown that the new CG method performs better compare to other CG methods.
|
| title |
A combination of FR and HS coefficient in conjugate gradient method for unconstrained optimization
|
| title_full |
A combination of FR and HS coefficient in conjugate gradient method for unconstrained optimization
|
| title_fullStr |
A combination of FR and HS coefficient in conjugate gradient method for unconstrained optimization
|
| title_full_unstemmed |
A combination of FR and HS coefficient in conjugate gradient method for unconstrained optimization
|
| title_short |
A combination of FR and HS coefficient in conjugate gradient method for unconstrained optimization
|
| title_sort |
combination of fr and hs coefficient in conjugate gradient method for unconstrained optimization
|