Three term Conjugate Gradient for solving unconstrained optimization / Nur Farah Hanis Rozaimi
Conjugate Gradient (CG) method is one of the popular methods that solve the large- scale unconstrained optimization problems, because they do not need the storage of matrices. In this paper, we are particularly interested in three-term conjugate gradient methods. We are using only classical paramete...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 語言: | English |
| 出版: |
2018
|
| 主題: | |
| 在線閱讀: | https://ir.uitm.edu.my/id/eprint/39360/1/39360.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | Conjugate Gradient (CG) method is one of the popular methods that solve the large- scale unconstrained optimization problems, because they do not need the storage of matrices. In this paper, we are particularly interested in three-term conjugate gradient methods. We are using only classical parameter on this paper. In this paper, we are using exact line search. These methods have been tested using only the selected optimization test function with different initial point from the nearest to the solution point to the furthest from the solution point. The result is analysed based on the number of the iteration and CPU time. Based on the result, Narushima et al. is the best method of all in term of both number of iteration and CPU times. |
|---|