Modification of Steepest Descent Method for Solving Unconstrained Optimization

Simple item page
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.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.identifier.urihttps://umt-ir.umt.edu.my/handle/123456789/17622
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
Files
Original bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
QA 76.6 .Z8 2014-Abstract.pdf
Size:
100.52 KB
Format:
Adobe Portable Document Format
Description:
Download
No Thumbnail Available
Name:
QA 76.6 .Z8 2014-Full Text.pdf
Size:
2.72 MB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Pusat Pengajian Informatik dan Matematik Gunaan