Modification of Steepest Descent Method for Solving Unconstrained Optimization
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.
Saved in:
Main Author: | Zubai'dah Binti Zainal Abidin |
---|---|
Format: | Thesis |
Language: | English |
Subjects: | |
Online Access: | http://umt-ir.umt.edu.my:8080/jspui/bitstream/123456789/17622/1/QA%2076.6%20.Z8%202014-Abstract.pdf http://umt-ir.umt.edu.my:8080/jspui/bitstream/123456789/17622/2/QA%2076.6%20.Z8%202014-Full%20Text.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Generalized Barzilai and Borwein method for large-scale unconstrained optimization.
by: Koo, Boon Yuan
Published: (2011) -
New search direction formula of steepest descent method for large scale unconstrained optimization
by: Siti Farhana binti Husin -
The investigation of gradient method namely Steepest Descent and extending of Barzilai Borwein for solving unconstrained optimization problem / Nur Intan Syahirah Ismail & Nur Atikah Aziz
by: Ismail, Nur Intan Syahirah, et al.
Published: (2019) -
Multiple Alternate Steps Gradient Methods For Unconstrained Optimization
by: Lee, Sui Fong
Published: (2009) -
Preconditioning Subspace Quasi-Newton Method for Large Scale Unconstrained Optimization
by: Sim, Hong Sen
Published: (2011)