Comparison of the AIM conjugate gradient method under exact and inexact line search for solving unconstrained optimization problems

Comparison of the AIM conjugate gradient method under exact and inexact line search for solving unconstrained optimization problems

The nonlinear conjugate gradient (CG) method is essential in solving large-scale unconstrained optimization problems due to its simplicity and low memory requirement. Numerous studies and improvements have been made recently to improve this strategy. Hence, this study will create a modified CG metho...

Full description

Saved in:
Bibliographic Details
Main Authors: Za’aba, Fatin Nadhirah, Marjugi, Siti Mahani
Format: Article
Published: Malaysian Mathematical Science Society 2021
Online Access:http://psasir.upm.edu.my/id/eprint/96474/
https://myjms.mohe.gov.my/index.php/dismath/article/view/15550/7995
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universiti Putra Malaysia
id my.upm.eprints.96474
record_format eprints
spelling my.upm.eprints.964742023-01-11T09:06:08Z http://psasir.upm.edu.my/id/eprint/96474/ Comparison of the AIM conjugate gradient method under exact and inexact line search for solving unconstrained optimization problems Za’aba, Fatin Nadhirah Marjugi, Siti Mahani The nonlinear conjugate gradient (CG) method is essential in solving large-scale unconstrained optimization problems due to its simplicity and low memory requirement. Numerous studies and improvements have been made recently to improve this strategy. Hence, this study will create a modified CG method with inexact line search, Strong Wolfe-Powell conditions. The global convergence and sufficient descent properties are established by using an inexact line search. The numerical result demonstrates that the modified method with inexact line search is superior and more efficient when compared to other CG methods. Malaysian Mathematical Science Society 2021 Article PeerReviewed Za’aba, Fatin Nadhirah and Marjugi, Siti Mahani (2021) Comparison of the AIM conjugate gradient method under exact and inexact line search for solving unconstrained optimization problems. Discovering Mathematics, 43 (2). 101 - 110. ISSN 2231-7023 https://myjms.mohe.gov.my/index.php/dismath/article/view/15550/7995
institution Universiti Putra Malaysia
building UPM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Putra Malaysia
content_source UPM Institutional Repository
url_provider http://psasir.upm.edu.my/
description The nonlinear conjugate gradient (CG) method is essential in solving large-scale unconstrained optimization problems due to its simplicity and low memory requirement. Numerous studies and improvements have been made recently to improve this strategy. Hence, this study will create a modified CG method with inexact line search, Strong Wolfe-Powell conditions. The global convergence and sufficient descent properties are established by using an inexact line search. The numerical result demonstrates that the modified method with inexact line search is superior and more efficient when compared to other CG methods.
format Article
author Za’aba, Fatin Nadhirah
Marjugi, Siti Mahani
spellingShingle Za’aba, Fatin Nadhirah
Marjugi, Siti Mahani
Comparison of the AIM conjugate gradient method under exact and inexact line search for solving unconstrained optimization problems
author_facet Za’aba, Fatin Nadhirah
Marjugi, Siti Mahani
author_sort Za’aba, Fatin Nadhirah
title Comparison of the AIM conjugate gradient method under exact and inexact line search for solving unconstrained optimization problems
title_short Comparison of the AIM conjugate gradient method under exact and inexact line search for solving unconstrained optimization problems
title_full Comparison of the AIM conjugate gradient method under exact and inexact line search for solving unconstrained optimization problems
title_fullStr Comparison of the AIM conjugate gradient method under exact and inexact line search for solving unconstrained optimization problems
title_full_unstemmed Comparison of the AIM conjugate gradient method under exact and inexact line search for solving unconstrained optimization problems
title_sort comparison of the aim conjugate gradient method under exact and inexact line search for solving unconstrained optimization problems
publisher Malaysian Mathematical Science Society
publishDate 2021
url http://psasir.upm.edu.my/id/eprint/96474/
https://myjms.mohe.gov.my/index.php/dismath/article/view/15550/7995
_version_ 1755873905598267392

Similar Items