Please use this identifier to cite or link to this item: http://umt-ir.umt.edu.my:8080/handle/123456789/4719
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAbashar, Abdelrhaman-
dc.date.accessioned2016-11-19T03:31:48Z-
dc.date.available2016-11-19T03:31:48Z-
dc.date.issued2014-08-
dc.identifier.urihttp://hdl.handle.net/123456789/4719-
dc.description.abstractConjugate gradient methods (CG) have an important part in unconstrained optimizations. Numerous studies and modifications have been concerned to improve these methods. In this study, two modifications of the CG coefficient (Bk) are proposed in a way to solve unconstrained optimization problems using exact line searches and inexact line searches by employing strong Wolfe line search.en_US
dc.language.isoenen_US
dc.publisherTerengganu: Universiti Malaysia Terengganuen_US
dc.subjectQA 218 .A2 2014en_US
dc.subjectAbashar, Abdelrhamanen_US
dc.subjectTesis PPIMG 2014en_US
dc.subjectConjugate gradient methodsen_US
dc.titleA new type of conjugate gradient methods with sufficient descent property for unconstrained optimizationen_US
dc.typeThesisen_US
Appears in Collections:Pusat Pengajian Informatik dan Matematik Gunaan

Files in This Item:
File Description SizeFormat 
tesis QA 218 .A2 2014 Abstract.pdf794.66 kBAdobe PDFView/Open
tesis QA 218 .A2 2014 FullText.pdf
  Restricted Access
22.64 MBAdobe PDFView/Open Request a copy


Items in UMT-IR are protected by copyright, with all rights reserved, unless otherwise indicated.