Comparison of four Conjugate Gradient method with exact line search / Muhammad Adib Usairi Hamzah
One of the best solution to solve unconstrained optimization problems is by using Conjugate Gradient(CG) method it is due to low memory requirement. Hence, it can be used to solve large problem. By using coefficient of CG( /?k ) for this research, number of iteration and CPU time are calculated for...
Saved in:
Main Author: | Hamzah, Muhammad Adib Usairi |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2017
|
Subjects: | |
Online Access: | https://ir.uitm.edu.my/id/eprint/41213/1/41213.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Numerical performance of three conjugate gradient methods using exact line search / Nurul Asyiqin Sobaruddin
by: Sobaruddin, Nurul Asyiqin
Published: (2019) -
Numerical comparison between classical conjugate gradient and modified conjugate gradient / Mohd Afif Hamran
by: Hamran, Mohd Afif
Published: (2018) -
Three term conjugate gradient for solving unconstrained optimization using exact line search / Alia Syafiqa Suhaimi & Nur Hasnah Md Hassan
by: Suhaimi, Alia Syafiqa, et al.
Published: (2019) -
Comparison between four non-classical conjugate gradient method for solving unconstrained optimization problem / Nik Nurshahfini Daud and Farah Ellyna Mohamad Fadzal
by: Daud, Nik Nurshahfini, et al.
Published: (2019) -
The efficiency of conjugate gradient methods with global convergence / Siti Nur Hafiza Shamsudin
by: Shamsudin, Siti Nur Hafiza
Published: (2019)