Please use this identifier to cite or link to this item:
http://umt-ir.umt.edu.my:8080/handle/123456789/5032
Title: | Modification of steepest descent method for solving unconstrained optimization |
Authors: | Zubai'ah Zainal Abidin |
Keywords: | QA 76.6 .Z8 2014 Zubai'ah Zainal Abidin Tesis PPIMG 2014 Optimizing compilers |
Issue Date: | Mar-2014 |
Publisher: | Terengganu: Universiti Malaysia Terengganu |
Series/Report no.: | ;QA 76.6 .Z8 2014 |
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 especial! in the form of computer codes. In this research, a new modification of SD method is proposed using a new search direction (dk) in the form of two parameters. The numerical result based on number of iteration and CPU time using standard optimization test problems shows that this modification SD converges faster and efficient than the classical SD method. |
URI: | http://hdl.handle.net/123456789/5032 |
Appears in Collections: | Pusat Pengajian Informatik dan Matematik Gunaan |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
QA 76.6 .Z8 2014 Abstract.pdf | 992.71 kB | Adobe PDF | View/Open | |
QA 76.6 .Z8 2014 FullText.pdf Restricted Access | 18.44 MB | Adobe PDF | View/Open Request a copy |
Items in UMT-IR are protected by copyright, with all rights reserved, unless otherwise indicated.