Algorithm for Solution of Non-convex Optimization Problem Through Piece-wise Convex Transformation

Authors

  • Lee Chang Kerk Universiti Teknologi Malaysia
  • Rohanin Ahmad Universiti Teknologi Malaysia

DOI:

https://doi.org/10.11113/matematika.v34.n2.977

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 Kerk and Rohanin’s Trusted Interval will be introduced. The method introduced is able to identify all local solutions by converting non-convex optimization problems into piece-wise convex optimization problems. A mechanism which only considers 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 globally convergent 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.

Downloads

Published

2018-12-30

How to Cite

Kerk, L. C., & Ahmad, R. (2018). Algorithm for Solution of Non-convex Optimization Problem Through Piece-wise Convex Transformation. MATEMATIKA: Malaysian Journal of Industrial and Applied Mathematics, 34(2), 381–392. https://doi.org/10.11113/matematika.v34.n2.977

Issue

Section

Articles