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 |
Published: |
Universiti Malaysia Terengganu
2023
|
Subjects: | |
Online Access: | http://umt-ir.umt.edu.my:8080/handle/123456789/17622 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
my.umt.ir-17622 |
---|---|
record_format |
eprints |
spelling |
my.umt.ir-176222023-04-03T00:18:53Z Modification of Steepest Descent Method for Solving Unconstrained Optimization Zubai'dah Binti Zainal Abidin QA 76.6 .Z8 2014 Steepest Descent Method 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. 2023-04-03T00:18:50Z 2023-04-03T00:18:50Z 2014-03 Thesis http://umt-ir.umt.edu.my:8080/handle/123456789/17622 en application/pdf application/pdf Universiti Malaysia Terengganu |
institution |
Universiti Malaysia Terengganu |
building |
Perpustakaan Sultanah Nur Zahirah |
collection |
Institutional Repository |
continent |
Asia |
country |
Malaysia |
content_provider |
Universiti Malaysia Terengganu |
content_source |
UMT-IR |
url_provider |
http://umt-ir.umt.edu.my:8080/ |
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 |
publisher |
Universiti Malaysia Terengganu |
publishDate |
2023 |
url |
http://umt-ir.umt.edu.my:8080/handle/123456789/17622 |
_version_ |
1762393826707636224 |
score |
13.214268 |