Research Communication | Open Access
Volume 2019 | Communication ID 3
Volume 2019 | Communication ID 3
| A covering method combined with the Hook-Jeeves algorithm for continuous global optimization problems |
Raouf Ziadi
Received |
Accepted |
Published |
Sep 25, 2018 |
Dec 31, 2018 |
Mar 01, 2019 |
Abstract: In this paper, a method for solving the global optimization problems where the objective function is only continuous is presented. It is based on the generation of parameterized curves combined with the Evtushenko algorithm. It is established that this method converges in a finite number of iterations to the global minimum. To accelerate the corresponding mixed algorithm we have incorporated the deterministic local optimization method of Hooke and Jeeves. Numerical experiments are performed on some typical test problems and the detailed numerical results show that the algorithm is promising.