Please use this identifier to cite or link to this item: http://umt-ir.umt.edu.my:8080/handle/123456789/17622
Full metadata record
DC FieldValueLanguage
dc.contributor.authorZubai'dah Binti Zainal Abidin-
dc.date.accessioned2023-04-03T00:18:50Z-
dc.date.available2023-04-03T00:18:50Z-
dc.date.issued2014-03-
dc.identifier.urihttp://umt-ir.umt.edu.my:8080/handle/123456789/17622-
dc.description.abstractThe Classical steepest descent (SD) method is known as one of the earliest and the best method to minimize a function. Even though the convergence rate is quite slow, but its simplicity has made it one of the easiest methods to be used and applied especially in the form of computer codes.en_US
dc.language.isoenen_US
dc.publisherUniversiti Malaysia Terengganuen_US
dc.subjectQA 76.6 .Z8 2014en_US
dc.subjectSteepest Descent Methoden_US
dc.subjectUnconstrained Optimizationen_US
dc.titleModification of Steepest Descent Method for Solving Unconstrained Optimizationen_US
dc.typeThesisen_US
Appears in Collections:Pusat Pengajian Informatik dan Matematik Gunaan

Files in This Item:
File Description SizeFormat 
QA 76.6 .Z8 2014-Abstract.pdf100.52 kBAdobe PDFView/Open
QA 76.6 .Z8 2014-Full Text.pdf
  Restricted Access
2.79 MBAdobe PDFView/Open Request a copy


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