Please use this identifier to cite or link to this item: http://umt-ir.umt.edu.my:8080/handle/123456789/5466
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAlhawarat, A.-
dc.contributor.authorMustafa, M.-
dc.contributor.authorIsmail, M.-
dc.contributor.authorZabidin, S.-
dc.date.accessioned2017-04-09T08:26:31Z-
dc.date.available2017-04-09T08:26:31Z-
dc.date.issued2016-02-
dc.identifier.citationVol 10 ; 91-101 p.en_US
dc.identifier.urihttp://hdl.handle.net/123456789/5466-
dc.description.abstractConjugate gradient method (CG), is one of many methods used to solve large scale optimization problems in many fields. In fact memory storage and speed of the algorithm to reach the optimum solution for general nonlinear unconstrained optimization functions are our goals. In this paper, we modified a new efficient method passes the sufficient decent condition, and it has global convergence under exact line search and strong Wolfe line search. Furthermore the numerical results to find the optimum solution of some test functions show the new modification has the best results in CPU time, and the number of iteration when it comparing with other conventional methods.en_US
dc.language.isoenen_US
dc.publisherMalaysian Journal of Mathematical Sciencesen_US
dc.subjectGradient Methoden_US
dc.subjectExact Line Searchen_US
dc.subjectStrong Wolf Line Searchen_US
dc.subjectGlobal Convergenceen_US
dc.titleA Modified NPRP Nonlinear Conjugate Gradient Method with Global Convergence Propertiesen_US
dc.typeArticleen_US
Appears in Collections:Journal Articles

Files in This Item:
File Description SizeFormat 
015-A Modified NPRP Nonlinear Conjugate Gradient Method with Global Convergence Properties.pdfFull Text606.54 kBAdobe PDFView/Open


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