Extension of RMIL conjugate gradient method for unconstrained optimization / Nur Idalisa Norddin

The Conjugate Gradient (CG) methods have significantly contributed to solving Unconstrained Optimization (UO) problems. This research focused on the modification of existing CG method of Rivaie, Mustafa, Ismail and Leong (RMIL). RMIL is ubiquitous for its effectiveness as an optimization technique,...

Full description

Saved in:
Bibliographic Details
Main Author: Norddin, Nur Idalisa
Format: Thesis
Language:English
Published: 2023
Subjects:
Online Access:https://ir.uitm.edu.my/id/eprint/88937/1/88937.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
id my-uitm-ir.88937
record_format uketd_dc
spelling my-uitm-ir.889372024-02-06T03:22:03Z Extension of RMIL conjugate gradient method for unconstrained optimization / Nur Idalisa Norddin 2023 Norddin, Nur Idalisa Analysis The Conjugate Gradient (CG) methods have significantly contributed to solving Unconstrained Optimization (UO) problems. This research focused on the modification of existing CG method of Rivaie, Mustafa, Ismail and Leong (RMIL). RMIL is ubiquitous for its effectiveness as an optimization technique, yet their significance remains to be defined and their full potential is yet to be realized. Even the global convergence theoretical is available for RMIL method, it only applies for the positive RMIL parameter. Indeed, the numerical performance of RMIL method is impressive regardless of its parameter sign. Much efforts have been made previously to increase the efficiency of RMIL method. Hence, this research proposed a CG search direction named NEW RMIL by combining the scaled negative gradient as initial direction and a third-term parameter. Sufficient Descent Condition (SDC) and global convergence qualities for both the exact and the strong Wolfe line search were demonstrated to exist in NEWRMIL algorithm. The experiments were performed by a total of 44 multi-dimensional mathematical test functions with various levels of complexity. When compared with the existing CG methods, NEWRMIL performs similarly under precise line search, while under Strong Wolfe line search NEWRMIL is superior and relatively faster convergence speed. Additionally, the practicality of NEWRMIL was demonstrated in solving multiple linear regression problems. The findings show that the NEWRMIL algorithm is the most efficient and has the minimum NOI and CPU time when compared to the direct technique and existing CG methods. 2023 Thesis https://ir.uitm.edu.my/id/eprint/88937/ https://ir.uitm.edu.my/id/eprint/88937/1/88937.pdf text en public phd doctoral Universiti Teknologi MARA (UiTM) College of Computing, Informatics and Media Mohd Ali, Mohd Rivaie
institution Universiti Teknologi MARA
collection UiTM Institutional Repository
language English
advisor Mohd Ali, Mohd Rivaie
topic Analysis
spellingShingle Analysis
Norddin, Nur Idalisa
Extension of RMIL conjugate gradient method for unconstrained optimization / Nur Idalisa Norddin
description The Conjugate Gradient (CG) methods have significantly contributed to solving Unconstrained Optimization (UO) problems. This research focused on the modification of existing CG method of Rivaie, Mustafa, Ismail and Leong (RMIL). RMIL is ubiquitous for its effectiveness as an optimization technique, yet their significance remains to be defined and their full potential is yet to be realized. Even the global convergence theoretical is available for RMIL method, it only applies for the positive RMIL parameter. Indeed, the numerical performance of RMIL method is impressive regardless of its parameter sign. Much efforts have been made previously to increase the efficiency of RMIL method. Hence, this research proposed a CG search direction named NEW RMIL by combining the scaled negative gradient as initial direction and a third-term parameter. Sufficient Descent Condition (SDC) and global convergence qualities for both the exact and the strong Wolfe line search were demonstrated to exist in NEWRMIL algorithm. The experiments were performed by a total of 44 multi-dimensional mathematical test functions with various levels of complexity. When compared with the existing CG methods, NEWRMIL performs similarly under precise line search, while under Strong Wolfe line search NEWRMIL is superior and relatively faster convergence speed. Additionally, the practicality of NEWRMIL was demonstrated in solving multiple linear regression problems. The findings show that the NEWRMIL algorithm is the most efficient and has the minimum NOI and CPU time when compared to the direct technique and existing CG methods.
format Thesis
qualification_name Doctor of Philosophy (PhD.)
qualification_level Doctorate
author Norddin, Nur Idalisa
author_facet Norddin, Nur Idalisa
author_sort Norddin, Nur Idalisa
title Extension of RMIL conjugate gradient method for unconstrained optimization / Nur Idalisa Norddin
title_short Extension of RMIL conjugate gradient method for unconstrained optimization / Nur Idalisa Norddin
title_full Extension of RMIL conjugate gradient method for unconstrained optimization / Nur Idalisa Norddin
title_fullStr Extension of RMIL conjugate gradient method for unconstrained optimization / Nur Idalisa Norddin
title_full_unstemmed Extension of RMIL conjugate gradient method for unconstrained optimization / Nur Idalisa Norddin
title_sort extension of rmil conjugate gradient method for unconstrained optimization / nur idalisa norddin
granting_institution Universiti Teknologi MARA (UiTM)
granting_department College of Computing, Informatics and Media
publishDate 2023
url https://ir.uitm.edu.my/id/eprint/88937/1/88937.pdf
_version_ 1794192177844191232