%0 Journal Article
%T A mixed algorithm for smooth global optimization
%J Journal of Mathematical Modeling
%I University of Guilan
%Z 2345-394X
%A Ziadi, Raouf
%A Bencherif-Madani, Abdelatif
%D 2023
%\ 07/01/2023
%V 11
%N 2
%P 207-228
%! A mixed algorithm for smooth global optimization
%K Global optimization
%K Alienor dimensionality reduction technique
%K One-dimensional global search algorithm
%K Limited Memory BFGS-B algorithm
%R 10.22124/jmm.2022.23133.2061
%X This paper presents a covering algorithm for solving bound-constrained global minimization problems with a differentiable cost function. In the proposed algorithm, we suggest to explore the feasible domain using a one-dimensional global search algorithm through a number of parametric curves that are relatively spread and simultaneously scan the search space. To accelerate the corresponding algorithm, we incorporate a multivariate quasi-Newton local search algorithm to spot the lowest regions. The proposed algorithm converges in a finite number of iterations to an $\varepsilon$-approximation of the global minimum. The performance of the algorithm is demonstrated through numerical experiments on some typical test functions.
%U https://jmm.guilan.ac.ir/article_6201_56e857ceeea5c3d0d27c810b087698e4.pdf