Global optimization using homotopy with 2-step predictor-corrector method

In optimization, most established search methods are local searches. Thus the development of a method that can be relied upon to find global solutions are therefore highly significant. Homotopy Optimization with Perturbations and Ensembles (HOPE) is such a method. In HOPE, a large storage space is r...

Full description

Saved in:
Bibliographic Details
Main Author: Kerk, Lee Chang
Format: Thesis
Language:English
Published: 2014
Subjects:
Online Access:http://eprints.utm.my/id/eprint/53477/25/KerkLeeChangMFS2014.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
id my-utm-ep.53477
record_format uketd_dc
spelling my-utm-ep.534772020-07-16T01:20:21Z Global optimization using homotopy with 2-step predictor-corrector method 2014-11 Kerk, Lee Chang QA Mathematics In optimization, most established search methods are local searches. Thus the development of a method that can be relied upon to find global solutions are therefore highly significant. Homotopy Optimization with Perturbations and Ensembles (HOPE) is such a method. In HOPE, a large storage space is required to store the points generated during its execution and subsequently its space and time complexity will become higher which causes the operational cost of HOPE to be expensive. This is the weakness of HOPE. In this study, a new method which is an improvement over HOPE called Homotopy 2-Step Predictor-Corrector Method (HSPM) is proposed. HSPM applies the Intermediate Value Theorem (IVT) coupled with the modified Predictor-Corrector Halley method (PCH) to overcome the weakness of HOPE. In HSPM, subintervals within which the extremizers lie, called 'trusted' intervals are found based on IVT. A random point is selected from the 'trusted' interval as an initial point to a local search. Each 'trusted' interval produces one local solution. Lastly, the global solution is determined from the local solutions accumulated. From the results, HSPM has been very successful as a minimization tool. It is able to cope with various types of functions' landscapes and able to detect more than one global solutions. Furthermore, HSPM can identify all the minimizers regardless of the step sizes used by the homotopy function. Hence, it has a high success rate in getting to a global minimizer compared to HOPE. Complexity analysis is employed to show the improvement achieved by HSPM. Based on the analysis, HSPM successfully managed to reduce the computational burden suffered by HOPE and acts as a good method in solving one dimensional optimization problem. However, to cope with the requirements today it needs to be extended to deal with multivariable functions for its future work. 2014-11 Thesis http://eprints.utm.my/id/eprint/53477/ http://eprints.utm.my/id/eprint/53477/25/KerkLeeChangMFS2014.pdf application/pdf en public http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:124972 masters Universiti Teknologi Malaysia, Faculty of Science Faculty of Science
institution Universiti Teknologi Malaysia
collection UTM Institutional Repository
language English
topic QA Mathematics
spellingShingle QA Mathematics
Kerk, Lee Chang
Global optimization using homotopy with 2-step predictor-corrector method
description In optimization, most established search methods are local searches. Thus the development of a method that can be relied upon to find global solutions are therefore highly significant. Homotopy Optimization with Perturbations and Ensembles (HOPE) is such a method. In HOPE, a large storage space is required to store the points generated during its execution and subsequently its space and time complexity will become higher which causes the operational cost of HOPE to be expensive. This is the weakness of HOPE. In this study, a new method which is an improvement over HOPE called Homotopy 2-Step Predictor-Corrector Method (HSPM) is proposed. HSPM applies the Intermediate Value Theorem (IVT) coupled with the modified Predictor-Corrector Halley method (PCH) to overcome the weakness of HOPE. In HSPM, subintervals within which the extremizers lie, called 'trusted' intervals are found based on IVT. A random point is selected from the 'trusted' interval as an initial point to a local search. Each 'trusted' interval produces one local solution. Lastly, the global solution is determined from the local solutions accumulated. From the results, HSPM has been very successful as a minimization tool. It is able to cope with various types of functions' landscapes and able to detect more than one global solutions. Furthermore, HSPM can identify all the minimizers regardless of the step sizes used by the homotopy function. Hence, it has a high success rate in getting to a global minimizer compared to HOPE. Complexity analysis is employed to show the improvement achieved by HSPM. Based on the analysis, HSPM successfully managed to reduce the computational burden suffered by HOPE and acts as a good method in solving one dimensional optimization problem. However, to cope with the requirements today it needs to be extended to deal with multivariable functions for its future work.
format Thesis
qualification_level Master's degree
author Kerk, Lee Chang
author_facet Kerk, Lee Chang
author_sort Kerk, Lee Chang
title Global optimization using homotopy with 2-step predictor-corrector method
title_short Global optimization using homotopy with 2-step predictor-corrector method
title_full Global optimization using homotopy with 2-step predictor-corrector method
title_fullStr Global optimization using homotopy with 2-step predictor-corrector method
title_full_unstemmed Global optimization using homotopy with 2-step predictor-corrector method
title_sort global optimization using homotopy with 2-step predictor-corrector method
granting_institution Universiti Teknologi Malaysia, Faculty of Science
granting_department Faculty of Science
publishDate 2014
url http://eprints.utm.my/id/eprint/53477/25/KerkLeeChangMFS2014.pdf
_version_ 1747817564848783360