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...

Full description

Saved in:
Bibliographic Details
Main Author: Rozaimi, Nur Farah Hanis
Format: Thesis
Language:English
Published: 2018
Subjects:
Online Access:https://ir.uitm.edu.my/id/eprint/39360/1/39360.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
id my-uitm-ir.39360
record_format uketd_dc
spelling my-uitm-ir.393602020-12-18T03:00:41Z Three term Conjugate Gradient for solving unconstrained optimization / Nur Farah Hanis Rozaimi 2018-01 Rozaimi, Nur Farah Hanis Mathematical statistics. Probabilities Analysis Algorithms 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. 2018-01 Thesis https://ir.uitm.edu.my/id/eprint/39360/ https://ir.uitm.edu.my/id/eprint/39360/1/39360.pdf text en public degree Universiti Teknologi MARA Faculty of Computer and Mathematical Sciences Jusoh, Ibrahim
institution Universiti Teknologi MARA
collection UiTM Institutional Repository
language English
advisor Jusoh, Ibrahim
topic Mathematical statistics
Probabilities
Analysis
Algorithms
spellingShingle Mathematical statistics
Probabilities
Analysis
Algorithms
Rozaimi, Nur Farah Hanis
Three term Conjugate Gradient for solving unconstrained optimization / Nur Farah Hanis Rozaimi
description 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.
format Thesis
qualification_level Bachelor degree
author Rozaimi, Nur Farah Hanis
author_facet Rozaimi, Nur Farah Hanis
author_sort Rozaimi, Nur Farah Hanis
title Three term Conjugate Gradient for solving unconstrained optimization / Nur Farah Hanis Rozaimi
title_short Three term Conjugate Gradient for solving unconstrained optimization / Nur Farah Hanis Rozaimi
title_full Three term Conjugate Gradient for solving unconstrained optimization / Nur Farah Hanis Rozaimi
title_fullStr Three term Conjugate Gradient for solving unconstrained optimization / Nur Farah Hanis Rozaimi
title_full_unstemmed Three term Conjugate Gradient for solving unconstrained optimization / Nur Farah Hanis Rozaimi
title_sort three term conjugate gradient for solving unconstrained optimization / nur farah hanis rozaimi
granting_institution Universiti Teknologi MARA
granting_department Faculty of Computer and Mathematical Sciences
publishDate 2018
url https://ir.uitm.edu.my/id/eprint/39360/1/39360.pdf
_version_ 1783734507267948544