Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/23709
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNur Syarafina Mohamed-
dc.contributor.authorMustafa Mamat-
dc.contributor.authorMohd Rivaie-
dc.contributor.authorShazlyn Milleana Shaharuddin-
dc.contributor.author(UniKL MITEC)-
dc.date.accessioned2020-02-11T03:26:58Z-
dc.date.available2020-02-11T03:26:58Z-
dc.date.issued2020-02-11-
dc.identifier.urihttp://ir.unikl.edu.my/jspui/handle/123456789/23709-
dc.description.abstractHybridization is one of the frequent approaches in modifying the Conjugate Gradient (CG) method. In this paper, a new hybrid CG is introduced, and its performance is compared under two different line searches; exact and inexact line searches. The proposed hybrid CG is known as HSMR, is evaluated as a convex combination of RMIL and SMR methods. The comparisons were tested with twenty one different test functions under various dimensions. Both results are compared between number of iterations and total number of CPU time. The comparison performance showed that the hybrid CG is promising under exact line search compared to inexact line search in both of number of iterations and central CPU time.en_US
dc.subjectConjugate Gradient Methoden_US
dc.subjectExact Line Searchen_US
dc.subjectHybrid Conjugate Gradient Methoden_US
dc.titleHYBRID CONJUGATE GRADIENT METHOD UNDER EXACT AND INEXACT LINE SEARCHen_US
dc.conference.nameInternational COnference on Mathematics, Statistics, and Applied Sciences (ICMSA)en_US
dc.conference.year2020en_US
Appears in Collections:Conference Paper

Files in This Item:
File Description SizeFormat 
HYBRID CONJUGATE GRADIENT METHOD UNDER EXACT AND INEXACT LINE SEARCH.pdf13.67 kBAdobe PDFView/Open    Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.