A globally convergent hybrid conjugate gradient method for solving unconstrained optimization problems / Ain Aqiela Azamuddin
The Conjugate Gradient (CG) method is utilized among researchers in solving optimization problems. It possesses characteristics that distinguish the steepest descent and Newton’s method. For example, it has a faster convergence rate than steepest descent method and a lesser computational cost than N...
Saved in:
Main Author: | Azamuddin, Ain Aqiela |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2024
|
Subjects: | |
Online Access: | https://ir.uitm.edu.my/id/eprint/107153/1/107153.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A comparison of the Jacobi method, Successive Over-Relaxation (SOR), Conjugate Gradient (CG), and Preconditioned Conjugate Gradient (PCG) in solving linear systems / Allisya Farhana Azmi Hisham
by: Azmi Hisham, Allisya Farhana
Published: (2023) -
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) -
The implementation of hybrid conjugate gradient method in electromagnetic tomography / Michelle Ubong Sari
by: Sari, Michelle Ubong
Published: (2024) -
Solving Large System Of Linear Equation Using Iterative Methods (Successive Over-Relaxation, Conjugate Gradient And Preconditioned Conjugate Gradient) / Nurhanani Abu Bakar
by: Abu Bakar, Nurhanani
Published: (2017) -
The influence of the second inequality of strong Wolfe to the performance of conjugate gradient / Nurhanani Abdul Latif
by: Abdul Latif, Nurhanani
Published: (2023)