Universiti Teknologi Malaysia Institutional Repository

Algorithm for solution of non-convex optimization problem through piece-wise convex transformation

Ahmad, Rohanin and Kerk, Lee Chang (2018) Algorithm for solution of non-convex optimization problem through piece-wise convex transformation. Matematika, 34 (2). pp. 381-392. ISSN 127-9602

Full text not available from this repository.

Abstract

Optimization is central to any problem involving decision making. The area of optimization has received enormous attention for over 30 years and it is still popular in research field to this day. In this paper, a global optimization method called Improved Homotopy with 2-Step Predictor-corrector Method will be introduced. The method in- troduced is able to identify all local solutions by converting non-convex optimization problems into piece-wise convex optimization problems. A mechanism which only consid- ers the convex part where minimizers existed on a function is applied. This mechanism allows the method to filter out concave parts and some unrelated parts automatically. The identified convex parts are called trusted intervals. The descent property and the global convergence of the method was shown in this paper. 15 test problems have been used to show the ability of the algorithm proposed in locating global minimizer.

Item Type:Article
Uncontrolled Keywords:convexity, globally convergent
Subjects:Q Science > QA Mathematics
Divisions:Science
ID Code:82335
Deposited By: Siti Nor Hashidah Zakaria
Deposited On:30 Sep 2019 09:00
Last Modified:26 Nov 2019 06:21

Repository Staff Only: item control page