Cover Image

On solving unconstrained optimization problem using three term conjugate gradient method / Nor Amila Sofiya Abdullah and Nurul Nadia Mohd Jalil

Conjugate Gradient method is commonly use to solve large scale unconstrained optimization problem. This is because they do not need the storage of matrices. Specifically, this project is to investigate more about three-term conjugate gradient methods. Inexact line search which is strong wolfe and mo...

Full description

Saved in:
Bibliographic Details
Main Authors: Abdullah, Nor Amila Sofiya, Mohd Jalil, Nurul Nadia
Format: Thesis
Language:English
Published: 2019
Subjects:
Equations
Mathematical statistics. Probabilities
Analysis
Algorithms
Online Access:http://ir.uitm.edu.my/id/eprint/41324/1/41324.pdf
http://ir.uitm.edu.my/id/eprint/41324/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.uitm.ir.41324
record_format eprints
spelling my.uitm.ir.413242021-02-04T09:54:21Z http://ir.uitm.edu.my/id/eprint/41324/ On solving unconstrained optimization problem using three term conjugate gradient method / Nor Amila Sofiya Abdullah and Nurul Nadia Mohd Jalil Abdullah, Nor Amila Sofiya Mohd Jalil, Nurul Nadia Equations Mathematical statistics. Probabilities Analysis Algorithms Conjugate Gradient method is commonly use to solve large scale unconstrained optimization problem. This is because they do not need the storage of matrices. Specifically, this project is to investigate more about three-term conjugate gradient methods. Inexact line search which is strong wolfe and modified parameter was use in this project. The methods that had been use in this project are Liu (2018), Norddin et. al.(2018), and modified Three-term Hestenes-Steifel (2007). These methods have been tested using several optimization test functions which are Extended Rosenbrock, Himmeblau function, Beale and White & Holst function . The result is analysed based on the number of iteration and CPU time. This expectation result from this research is to identify the best method for strong wolfe to solve large scale unconstrained optimization problems. 2019-07 Thesis NonPeerReviewed text en http://ir.uitm.edu.my/id/eprint/41324/1/41324.pdf Abdullah, Nor Amila Sofiya and Mohd Jalil, Nurul Nadia (2019) On solving unconstrained optimization problem using three term conjugate gradient method / Nor Amila Sofiya Abdullah and Nurul Nadia Mohd Jalil. Degree thesis, Universiti Teknologi MARA.
institution Universiti Teknologi Mara
building Tun Abdul Razak Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Mara
content_source UiTM Institutional Repository
url_provider http://ir.uitm.edu.my/
language English
topic Equations
Mathematical statistics. Probabilities
Analysis
Algorithms
spellingShingle Equations
Mathematical statistics. Probabilities
Analysis
Algorithms
Abdullah, Nor Amila Sofiya
Mohd Jalil, Nurul Nadia
On solving unconstrained optimization problem using three term conjugate gradient method / Nor Amila Sofiya Abdullah and Nurul Nadia Mohd Jalil
description Conjugate Gradient method is commonly use to solve large scale unconstrained optimization problem. This is because they do not need the storage of matrices. Specifically, this project is to investigate more about three-term conjugate gradient methods. Inexact line search which is strong wolfe and modified parameter was use in this project. The methods that had been use in this project are Liu (2018), Norddin et. al.(2018), and modified Three-term Hestenes-Steifel (2007). These methods have been tested using several optimization test functions which are Extended Rosenbrock, Himmeblau function, Beale and White & Holst function . The result is analysed based on the number of iteration and CPU time. This expectation result from this research is to identify the best method for strong wolfe to solve large scale unconstrained optimization problems.
format Thesis
author Abdullah, Nor Amila Sofiya
Mohd Jalil, Nurul Nadia
author_facet Abdullah, Nor Amila Sofiya
Mohd Jalil, Nurul Nadia
author_sort Abdullah, Nor Amila Sofiya
title On solving unconstrained optimization problem using three term conjugate gradient method / Nor Amila Sofiya Abdullah and Nurul Nadia Mohd Jalil
title_short On solving unconstrained optimization problem using three term conjugate gradient method / Nor Amila Sofiya Abdullah and Nurul Nadia Mohd Jalil
title_full On solving unconstrained optimization problem using three term conjugate gradient method / Nor Amila Sofiya Abdullah and Nurul Nadia Mohd Jalil
title_fullStr On solving unconstrained optimization problem using three term conjugate gradient method / Nor Amila Sofiya Abdullah and Nurul Nadia Mohd Jalil
title_full_unstemmed On solving unconstrained optimization problem using three term conjugate gradient method / Nor Amila Sofiya Abdullah and Nurul Nadia Mohd Jalil
title_sort on solving unconstrained optimization problem using three term conjugate gradient method / nor amila sofiya abdullah and nurul nadia mohd jalil
publishDate 2019
url http://ir.uitm.edu.my/id/eprint/41324/1/41324.pdf
http://ir.uitm.edu.my/id/eprint/41324/
_version_ 1691735784095219712
score 13.209306

Similar Items