Comparative study of several classical and modified conjugate gradient using inexact line search / Uzir Ibrahim
Conjugate gradient (CG) method is one of the method in finding minimization or maximization of objective function to solve unconstrained optimization problems. Many studies have been conducted recently to improve this method but some of the modified CG seem to be more difficult and complicated than...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://ir.uitm.edu.my/id/eprint/41318/1/41318.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Conjugate gradient (CG) method is one of the method in finding minimization or maximization of objective function to solve unconstrained optimization problems. Many studies have been conducted recently to improve this method but some of the modified CG seem to be more difficult and complicated than the older ones previously suggested. Therefore, in this paper, some simple classical and modified CG method will be compared based on number of iterations and CPU time to find the best solution point. The global convergence result is solved using strong Wolfe-Powell (SWP) inexact line search. Four difference initial point and five test functions is being used to test the efficiency of the CG coefficient. |
|---|