An improved Polak-Ribiere-Polyak method using strong wolfe-powell line search for unconstrained optimization problems
The unconstrained optimization problem has been dealing with different methods to be solved recently. The most common solution is the conjugate gradient (CG) method due to its convergence speed, simplicity, low memory requirements, and its capability to solve large-scale problems. There are ma...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Format: | Thesis Book |
| Language: | English |
| Subjects: |
Tembila Thesis Collection
| Call Number: |
QA427 D39 2020 |
|---|
| Accession | Item Category | Format | Status | Notes |
|---|
| 1000182128 | Reference | Thesis | Available |