| _version_ |
1860799661962428416
|
| building |
INTELEK Repository
|
| collection |
Online Access
|
| collectionurl |
https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072
|
| date |
2018-10-18 11:00:23
|
| eventvenue |
Kuala Lumpur, Malaysia
|
| format |
Restricted Document
|
| id |
6897
|
| institution |
UniSZA
|
| originalfilename |
1612-01-FH03-FIK-18-15781.jpg
|
| person |
norman
|
| recordtype |
oai_dc
|
| resourceurl |
https://intelek.unisza.edu.my/intelek/pages/view.php?ref=6897
|
| spelling |
6897 https://intelek.unisza.edu.my/intelek/pages/view.php?ref=6897 https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072 Restricted Document Conference Conference Paper image/jpeg inches 96 96 norman 62 62 1437 2018-10-18 11:00:23 745 1437x745 1612-01-FH03-FIK-18-15781.jpg UniSZA Private Access A new modification of conjugate gradient method with global convergence properties The most well-known technique or method in unconstrained optimization is the conjugate gradient method. It is used to get the greatest solution for the unconstrained optimization problems. This method is used in many fields especially, computer science, and engineering due to its convergence speed, simplicity, and the low memory requirements. A new modified conjugate gradient method is presented in this paper. This method is proved with the strong Wolfe-Powell (SWP) line search that it possesses sufficient descent property, and is globally convergent. Numerical results for a set of 141 test problems show the outperformance of the new proposed formula comparing with other methods using the same line search. The performance of this method is more efficient and better than the others. International Conference on Mathematics, Engineering and Industrial Applications 2018, ICoMEIA 2018 Kuala Lumpur, Malaysia
|
| spellingShingle |
A new modification of conjugate gradient method with global convergence properties
|
| summary |
The most well-known technique or method in unconstrained optimization is the conjugate gradient method. It is used to get the greatest solution for the unconstrained optimization problems. This method is used in many fields especially, computer science, and engineering due to its convergence speed, simplicity, and the low memory requirements. A new modified conjugate gradient method is presented in this paper. This method is proved with the strong Wolfe-Powell (SWP) line search that it possesses sufficient descent property, and is globally convergent. Numerical results for a set of 141 test problems show the outperformance of the new proposed formula comparing with other methods using the same line search. The performance of this method is more efficient and better than the others.
|
| title |
A new modification of conjugate gradient method with global convergence properties
|
| title_full |
A new modification of conjugate gradient method with global convergence properties
|
| title_fullStr |
A new modification of conjugate gradient method with global convergence properties
|
| title_full_unstemmed |
A new modification of conjugate gradient method with global convergence properties
|
| title_short |
A new modification of conjugate gradient method with global convergence properties
|
| title_sort |
new modification of conjugate gradient method with global convergence properties
|