Comparison of the AIM Conjugate Gradient Method Under Exact and Inexact Line Search for Solving Unconstrained Optimization Problems

  • F N Za’aba Department of Mathematics & Statistics, Faculty of Science, Universiti Putra Malaysia, 43400 UPM Serdang
  • S.M Marjugi Department of Mathematics & Statistics, Faculty of Science, Universiti Putra Malaysia, 43400 UPM Serdang

Abstract

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.

Published
2021-09-24
How to Cite
ZA’ABA, F N; MARJUGI, S.M. Comparison of the AIM Conjugate Gradient Method Under Exact and Inexact Line Search for Solving Unconstrained Optimization Problems. Menemui Matematik (Discovering Mathematics), [S.l.], v. 43, n. 2, p. 101-110, sep. 2021. ISSN 0126-9003. Available at: <https://myjms.mohe.gov.my/index.php/dismath/article/view/15550>. Date accessed: 20 jan. 2022.

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.