Please use this identifier to cite or link to this item: http://umt-ir.umt.edu.my:8080/handle/123456789/3033
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMohd Rivaie Mohd Ali-
dc.date.accessioned2014-05-18T07:21:06Z-
dc.date.available2014-05-18T07:21:06Z-
dc.date.issued2013-01-
dc.identifier.urihttp://dspace.psnz.umt.edu.my/xmlui/handle/123456789/3033-
dc.description.abstractConjugate gradient methods hold an important role in unconstrained optimizations. Numerous recent studies and modifications have been aimed to improve these methods. In this research, four modifications of the conjugate gradient coefficient (Bk ) are proposed in order to solve unconstrained optimization problems using exact line searches.en_US
dc.language.isoenen_US
dc.publisherTerengganu: Universiti Malaysia Terengganuen_US
dc.subjectQA 218 .M62 2013en_US
dc.subjectMohd Rivaie Mohd Alien_US
dc.subjectTesis FST 2013en_US
dc.subjectConjugate gradient methodsen_US
dc.titleNew conjugate gradient methods for solving large-scale unconstrained optimization problemsen_US
dc.typeThesisen_US
Appears in Collections:Fakulti Sains dan Teknologi

Files in This Item:
File Description SizeFormat 
QA 218 .M62 2013 Abstract.pdf28.74 kBAdobe PDFView/Open
QA 218 .M62 2013 FullText.pdf
  Restricted Access		3.52 MBAdobe PDFView/Open Request a copy
Show simple item record


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