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: |
Table of Contents:
- 1. General introduction
- 2. Mathematical review in optimization
- 3. Unconstrained optimization methods
- 4. New modification of CG methods
- 5. Numerical results and discussion
- 6. Conclusion