A new kind of conjugate gradient methods for unconstrained optimization
Conjugate gradient (CG) algorithms have been broadly applied to solve large-scale unconstrained optimization problems, because of its robustness, low memory requirement, and global convergence properties. Numerous studies and modifications have been carried out recently to improve these methods. In...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Format: | Thesis Book |
| Language: | English |
| Subjects: |
Tembila UniSZA Thesis Collection
| Call Number: |
QA218 R33 2015 |
|---|
| Accession | Item Category | Format | Status | Notes |
|---|
| 1000167575 | Reference | Thesis | Available |