New search direction formula of steepest descent method for large scale unconstrained optimization
One of the simplest optimization methods for solving unconstrained optimization problems is the steepest descent (SD) method. The main ad antage of the SD algorithm with exact line search is that it satisfies global convergence properties under suitable assumptions. This method requires only t...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Format: | Thesis Book |
| Language: | English |
| Subjects: |
Tembila Thesis Collection
| Call Number: |
QA402 5 S582021 |
|---|
| Accession | Item Category | Format | Status | Notes |
|---|
| 1000182812 | Reference | Thesis | Available |