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!
|
| Summary: | 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. |
|---|