Comparison of conjugate gradient method on solving unconstrained optimization problems

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 take...

وصف كامل

محفوظ في:
التفاصيل البيبلوغرافية
المؤلفون الرئيسيون: Maulana, Malik, Mustafa, Mamat, Siti Sabariah, Abas, Ibrahim, Mohammed Sulaiman, Sukono, ., Abdul Talib, Bon
التنسيق: Conference or Workshop Item
اللغة:English
English
منشور في: 2020
الموضوعات:
الوصول للمادة أونلاين:http://eprints.unisza.edu.my/1823/1/FH03-FIK-20-42148.pdf
http://eprints.unisza.edu.my/1823/2/FH03-FIK-20-42149.pdf
http://eprints.unisza.edu.my/1823/
الوسوم: إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
الوصف
الملخص: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.