New modification ofthe hestenes-stiefel with strong wolfe line search

Bibliographic Details
Format: Restricted Document
_version_ 1860796874020093952
building INTELEK Repository
collection Online Access
collectionurl https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072
date 2021-06-15 04:26:16
eventvenue Virtual
format Restricted Document
id 10510
institution UniSZA
originalfilename 4539-01-FH03-FIK-21-53285.pdf
person Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML
like Gecko) Chrome/91.0.4472.77 Safari/537.36
recordtype oai_dc
resourceurl https://intelek.unisza.edu.my/intelek/pages/view.php?ref=10510
spelling 10510 https://intelek.unisza.edu.my/intelek/pages/view.php?ref=10510 https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072 Restricted Document Conference Conference Paper application/pdf 4 1.6 Adobe Acrobat Pro DC 20 Paper Capture Plug-in Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML like Gecko) Chrome/91.0.4472.77 Safari/537.36 2021-06-15 04:26:16 4539-01-FH03-FIK-21-53285.pdf UniSZA Private Access New modification ofthe hestenes-stiefel with strong wolfe line search The method ofthe nonlinear conjugate gradient is widely used in solving large-scale unconstrained optimization since been proven in solving optimization problems without using large memory storage. In this paper, we proposed a new modification of the Hestenes-Stiefel conjugate gradient parameter that fulfils the condition of sufficient descent using a strong Wolfe-Powell line search. Besides, the conjugate gradient method with the proposed conjugate gradient also guarantees low computation of iteration and CPU time by comparing with other classical conjugate gradient parameters. Numerical results have shown that the conjugate gradient method with the proposed conjugate gradient parameter performed better than the conjugate gradient method with other classical conjugate gradient parameters. SCIEMATHIC 2020 Virtual
spellingShingle New modification ofthe hestenes-stiefel with strong wolfe line search
summary The method ofthe nonlinear conjugate gradient is widely used in solving large-scale unconstrained optimization since been proven in solving optimization problems without using large memory storage. In this paper, we proposed a new modification of the Hestenes-Stiefel conjugate gradient parameter that fulfils the condition of sufficient descent using a strong Wolfe-Powell line search. Besides, the conjugate gradient method with the proposed conjugate gradient also guarantees low computation of iteration and CPU time by comparing with other classical conjugate gradient parameters. Numerical results have shown that the conjugate gradient method with the proposed conjugate gradient parameter performed better than the conjugate gradient method with other classical conjugate gradient parameters.
title New modification ofthe hestenes-stiefel with strong wolfe line search
title_full New modification ofthe hestenes-stiefel with strong wolfe line search
title_fullStr New modification ofthe hestenes-stiefel with strong wolfe line search
title_full_unstemmed New modification ofthe hestenes-stiefel with strong wolfe line search
title_short New modification ofthe hestenes-stiefel with strong wolfe line search
title_sort new modification ofthe hestenes-stiefel with strong wolfe line search