Comparison of conjugate gradient method on solving unconstrained optimization problems

Maulana, Malik and Mustafa, Mamat and Siti Sabariah, Abas and Ibrahim, Mohammed Sulaiman and Sukono, . and Abdul Talib, Bon (2020) Comparison of conjugate gradient method on solving unconstrained optimization problems. In: 5th North American International Conference on Industrial Engineering and Operations Management, 10-14 Aug 2020, Michigan, USA.

[img] Text
FH03-FIK-20-42148.pdf
Restricted to Registered users only

Download (522kB)
[img] Text
FH03-FIK-20-42149.pdf
Restricted to Registered users only

Download (368kB)

Abstract

Conjugate gradient (CG) method approaches have been instrumental in solving unconstrained optimization problems. In 2020, Malik et al. have proposed a new hybrid coefficient (H-MS2), a combination of the RMIL coefficient and the new coefficient. In this paper, we propose the new method, which takes the new coefficients from H-MS2. Also, we will compare the new method and some of the classic methods that already based on the number of iterations and central processing unit (CPU) time. The new method fulfills the sufficient descent condition and global convergence properties, and it’s tested on a set functions under exact line search. The numerical results show that the new CG method has the best efficiency between all the methods tested.

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Conjugate gradient method, unconstrained optimization problems, sufficient descent condition, global convergence properties, exact line search
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Informatics & Computing
Depositing User: Muhammad Akmal Azhar
Date Deposited: 23 Nov 2020 04:24
Last Modified: 23 Nov 2020 04:24
URI: http://eprints.unisza.edu.my/id/eprint/1823

Actions (login required)

View Item View Item