The efficiency of conjugate gradient methods with global convergence / Siti Nur Hafiza Shamsudin
Conjugate gradient methods are usually used to solve any problem that related to large number of variables such as a large linear system of equations. Different conjugate gradient algorithms correspond to different choices for the scalar parameter /^(Andrei, N. (2013). A simple three-term conjugate...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2019
|
| Subjects: | |
| Online Access: | https://ir.uitm.edu.my/id/eprint/40641/1/40641.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Conjugate gradient methods are usually used to solve any problem that related to large number of variables such as a large linear system of equations. Different conjugate gradient algorithms correspond to different choices for the scalar parameter /^(Andrei, N. (2013). A simple three-term conjugate gradient algorithm for unconstrained optimization. Journal of Computational and Applied Mathematics, 241, 19-29.). However, if objectif function is linear function, then no different between CG method because it just produce the same results but when applied to general nonlinear functions, often the parameter /3k is computed using some other formulae which do not satisfy the conjugacy condition. Therefore, this study is conducted to compare the efficiency of CG methods base on the number of iteration and CPU time. The global convergence result is established using exact line searches. Numerical result shows that algorithm 2 which is one of the proposed CG methods is more efficiency when compared to other algorithms. |
|---|