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: | |
---|---|
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!
|
id |
my-umt-ir.-17622 |
---|---|
record_format |
uketd_dc |
spelling |
my-umt-ir.-176222023-04-03T00:18:53Z Modification of Steepest Descent Method for Solving Unconstrained Optimization Zubai'dah Binti Zainal Abidin 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. Universiti Malaysia Terengganu 2014-03 Thesis en http://umt-ir.umt.edu.my:8080/handle/123456789/17622 http://umt-ir.umt.edu.my:8080/jspui/bitstream/123456789/17622/1/QA%2076.6%20.Z8%202014-Abstract.pdf c526dae47b105015ac21485949d83c41 http://umt-ir.umt.edu.my:8080/jspui/bitstream/123456789/17622/2/QA%2076.6%20.Z8%202014-Full%20Text.pdf dabc1efd79847ce9f66f29f52e029f6e http://umt-ir.umt.edu.my:8080/jspui/bitstream/123456789/17622/3/license.txt 8a4605be74aa9ea9d79846c1fba20a33 QA 76.6 .Z8 2014 Steepest Descent Method Unconstrained Optimization |
institution |
Universiti Malaysia Terengganu |
collection |
UMT Repository System |
language |
English |
topic |
QA 76.6 .Z8 2014 Steepest Descent Method Unconstrained Optimization |
spellingShingle |
QA 76.6 .Z8 2014 Steepest Descent Method Unconstrained Optimization Zubai'dah Binti Zainal Abidin Modification of Steepest Descent Method for Solving Unconstrained Optimization |
description |
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. |
format |
Thesis |
author |
Zubai'dah Binti Zainal Abidin |
author_facet |
Zubai'dah Binti Zainal Abidin |
author_sort |
Zubai'dah Binti Zainal Abidin |
title |
Modification of Steepest Descent Method for Solving Unconstrained Optimization |
title_short |
Modification of Steepest Descent Method for Solving Unconstrained Optimization |
title_full |
Modification of Steepest Descent Method for Solving Unconstrained Optimization |
title_fullStr |
Modification of Steepest Descent Method for Solving Unconstrained Optimization |
title_full_unstemmed |
Modification of Steepest Descent Method for Solving Unconstrained Optimization |
title_sort |
modification of steepest descent method for solving unconstrained optimization |
granting_institution |
Universiti Malaysia Terengganu |
url |
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 |
_version_ |
1776103980857819136 |