Solving unconstrained minimization problems with a new hybrid conjugate gradient method

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

[img] Text
Restricted to Registered users only

Download (561kB)


Conjugate gradient (CG) method is an efficient method for solving unconstrained, large-scale optimization problems. Hybridization is one of the common approaches in the modification of the CG method. This paper presents a new hybrid CG and compares its efficiency with the classical CG method, which are Hestenes-Stiefel (HS), Nurul HajarMustafa-Rivaie (NHMR), Fletcher-Reeves (FR) and Wei-Yao-Liu (WYL) methods. The proposed a new hybrid CG is evaluated as a convex combination of HS and NHMR method. Their performance is analyzed under the exact line search. The new method satisfies the sufficient descent condition and supports global convergence. The results show that the new hybrid CG has the best efficiency among the classical CG of HS, NHMR, FR, and WYL in terms of the number of iterations (NOI) and the central processing unit (CPU) per time.

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Conjugate gradient method, exact line search, global convergence, hybrid conjugate gradient, sufficient descent condition.
Subjects: Q Science > QA Mathematics
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Informatics & Computing
Depositing User: Muhammad Akmal Azhar
Date Deposited: 23 Nov 2020 04:29
Last Modified: 23 Nov 2020 04:29

Actions (login required)

View Item View Item