| _version_ |
1860799654564724736
|
| building |
INTELEK Repository
|
| collection |
Online Access
|
| collectionurl |
https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072
|
| date |
2017-10-17 12:38:28
|
| eventvenue |
Vistana City Centre Kuantan, Pahang
|
| format |
Restricted Document
|
| id |
6868
|
| institution |
UniSZA
|
| originalfilename |
1484-01-FH03-FIK-17-10488.jpg
|
| person |
norman
|
| recordtype |
oai_dc
|
| resourceurl |
https://intelek.unisza.edu.my/intelek/pages/view.php?ref=6868
|
| spelling |
6868 https://intelek.unisza.edu.my/intelek/pages/view.php?ref=6868 https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072 Restricted Document Conference Conference Paper image/jpeg inches 96 96 norman 69 69 1437 2017-10-17 12:38:28 734 1437x734 1484-01-FH03-FIK-17-10488.jpg UniSZA Private Access Performance comparison of a new hybrid conjugate gradient method under exact and inexact line searches Conjugate gradient (CG) method is one of iterative techniques prominently used in solving unconstrained optimization problems due to its simplicity, low memory storage, and good convergence analysis. This paper presents a new hybrid conjugate gradient method, named NRM1 method. The method is analyzed under the exact and inexact line searches in given conditions. Theoretically, proofs show that the NRM1 method satisfies the sufficient descent condition with both line searches. The computational result indicates that NRM1 method is capable in solving the standard unconstrained optimization problems used. On the other hand, the NRM1 method performs better under inexact line search compared with exact line search. 1st International Conference on Applied and Industrial Mathematics and Statistics 2017, ICoAIMS 2017; Vistana City Centre Kuantan, Pahang
|
| spellingShingle |
Performance comparison of a new hybrid conjugate gradient method under exact and inexact line searches
|
| summary |
Conjugate gradient (CG) method is one of iterative techniques prominently used in solving unconstrained optimization problems due to its simplicity, low memory storage, and good convergence analysis. This paper presents a new hybrid conjugate gradient method, named NRM1 method. The method is analyzed under the exact and inexact line searches in given conditions. Theoretically, proofs show that the NRM1 method satisfies the sufficient descent condition with both line searches. The computational result indicates that NRM1 method is capable in solving the standard unconstrained optimization problems used. On the other hand, the NRM1 method performs better under inexact line search compared with exact line search.
|
| title |
Performance comparison of a new hybrid conjugate gradient method under exact and inexact line searches
|
| title_full |
Performance comparison of a new hybrid conjugate gradient method under exact and inexact line searches
|
| title_fullStr |
Performance comparison of a new hybrid conjugate gradient method under exact and inexact line searches
|
| title_full_unstemmed |
Performance comparison of a new hybrid conjugate gradient method under exact and inexact line searches
|
| title_short |
Performance comparison of a new hybrid conjugate gradient method under exact and inexact line searches
|
| title_sort |
performance comparison of a new hybrid conjugate gradient method under exact and inexact line searches
|