Improving the performance of conjugate gradient method in solving unconstrained optimization problems and its application
The conjugate gradient (CO) method is the best in iterative methods due to its simple algorithm, low memory storage, and good convergence analysis. However, a major problem of the existing CO methods is that it can be very slow on the certain type of unconstrained optimization problems. Therefore, t...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Format: | Thesis Book |
| Language: | English |
| Subjects: |
Tembila UniSZA Thesis Collection
| Call Number: |
QA218 N874 2017 |
|---|
| Accession | Item Category | Format | Status | Notes |
|---|
| 1000173185 | Reference | Thesis | Available |