Abstract
The aim of optimization methods is to identify the best results in the search area. In this research, we focused on a mixture of the interior point method, opposite gradient method, and mean-variance mapping optimization, named IPOG-MVMO, where the solutions can be obtained from the gradient field of the cost function on the constraint manifold. The process was divided into three main phases. In the first phase, the interior point method was applied for local searching. Secondly, the opposite gradient method was used to generate a population of candidate solutions. The last phase involved updating the population according to the mean and variance of the solutions. In the experiments on real parameter optimization problems, three types of functions, which were unimodal, multimodal, and continuous composition functions, were considered and used to compare our proposed method with other meta-heuristics techniques. The results showed that our proposed algorithms outperformed other algorithms in terms of finding the optimal solution.