Please use this identifier to cite or link to this item:
http://umt-ir.umt.edu.my:8080/handle/123456789/17622Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Zubai'dah Binti Zainal Abidin | - |
| dc.date.accessioned | 2023-04-03T00:18:50Z | - |
| dc.date.available | 2023-04-03T00:18:50Z | - |
| dc.date.issued | 2014-03 | - |
| dc.identifier.uri | http://umt-ir.umt.edu.my:8080/handle/123456789/17622 | - |
| dc.description.abstract | The 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.iso | en | en_US |
| dc.publisher | Universiti Malaysia Terengganu | en_US |
| dc.subject | QA 76.6 .Z8 2014 | en_US |
| dc.subject | Steepest Descent Method | en_US |
| dc.subject | Unconstrained Optimization | en_US |
| dc.title | Modification of Steepest Descent Method for Solving Unconstrained Optimization | en_US |
| dc.type | Thesis | en_US |
| Appears in Collections: | Pusat Pengajian Informatik dan Matematik Gunaan | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| QA 76.6 .Z8 2014-Abstract.pdf | 100.52 kB | Adobe PDF | View/Open | |
| QA 76.6 .Z8 2014-Full Text.pdf Restricted Access | 2.79 MB | Adobe PDF | View/Open Request a copy |
Items in UMT-IR are protected by copyright, with all rights reserved, unless otherwise indicated