Modification of three term Conjugate Gradient method for solving unconstrained optimization / Nurul Hafawati Fadhilah Hussian
Conjugate Gradient (CG) methods have an important role in solving large scale unconstrained optimization. These methods are recognized due to its low memory requirement and convergence speed. However, some CG methods still possess high number of iteration and CPU time when apply in the real life pro...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2019
|
| Subjects: | |
| Online Access: | https://ir.uitm.edu.my/id/eprint/91684/1/91684.pdf https://ir.uitm.edu.my/id/eprint/91684/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Teknologi Mara |
| Language: | English |
| Summary: | Conjugate Gradient (CG) methods have an important role in solving large scale unconstrained optimization. These methods are recognized due to its low memory requirement and convergence speed. However, some CG methods still possess high number of iteration and CPU time when apply in the real life problems. Hence, the researchers come out with many alternatives in order to improve the efficiency of the CG methods. Recently, Three Term CG method has become a research trend of CG method. The problem arise when the existing Three Term CG methods could only be used with inexact line search. When exact line search is applied, the formula of Three Term will be reduced to the standard CG method. |
|---|