A mixed algorithm for smooth global optimization

[1] N. Andrei, Nonlinear Optimization Applications Using the GAMS Technology, New York: Springer, 2013.

[2] S. Babaie-Kafaki, Z. Aminifard, S. Ghafoori, Nonmonotone diagonally scaled limited-memory BFGS methods with application to compressive sensing based on a penalty model, Appl. Num. Math. 181 (2022) 618–
629.
[3] P. Brachetti, M.D.F. Ciccoli, G.D. Pillo, S. Lucidi, A new version of the Price’s algorithm for global opti-
mization, J. Glob. Opt. 10 (1997) 165–184.
[4] R. H. Byrd, P. Lu, J. Nocedal, C. Zhu, A limited memory algorithm for bound constrained optimization,
SIAM J. Sci. Comput. 16 (1995) 1190–1208.
[5] Y. Cherruault, A. Guillez, Une mthode pour la recherche du minimum global dune fonctionnelle, CRAS Paris
296 (1983) 175–178.
[6] W. Deng, J. Xu, X.Z. Gao, H. Zhao, An enhanced MSIQDE algorithm with novel multiple strategies for
global optimization problems, IEEE Trans. Syst. Man. Cybern. 52 (2020) 1578–1587.
[7] Y.G. Evtushenko, Numerical Optimization Techniques, Springer, Berlin, 1985.

[8] R. Ellaia, M.Z. Es-Sadek, H. Kasbioui, Modified Piyavskii’s global one-dimensional optimization of a differ-
entiable function, Appl. Math. 3 (2012) 1306–1320.
[9] M. EL-Alem, A. Aboutahoun, S. Mahdi, Hybrid gradient simulated annealing algorithm for finding the
global optimal of a nonlinear unconstrained optimization problem, Soft Comput. 25 (2021) 2325–2350.
[10] A. Faramarzi, M. Heidarinejad, B. Stephens, S. Mirjalili, Equilibrium optimizer: A novel optimization algo-
rithm, Knowledge-Based Syst. 191 (2020) 105190.
[11] Z.W. Geem, J.H. Kim, G.V. Loganathan, A new heuristic optimization algorithm: harmony search, Simula-
tion 76 (2001) 60–68.
[12] D. Guettal, A. Ziadi, Reducing transformation and global optimization, Appl. Math. Comput. 218 (2012)
5848–5860.
[13] W. Huyer, A. Neumaier, Global optimization by multilevel coordinate search, J. Glob. Opt. 14 (1999) 331–
355.
[14] N. Keskar, A. Wachter, A limited-memory quasi-Newton algorithm for bound-constrained non-smooth opti-
mization, Opt. Meth. Soft. 34 (2019) 150–171.
[15] A. Kumar, R.K. Misra, D. Singh, S. Mishra, S. Das, The spherical search algorithm for bound-constrained
global optimization problems Appl. Soft Comput. 85 (2019) 105734.
[16] M. Ouanes, H. A. Le Thi, T. P. Nguyen, A. Zidna, New quadratic lower bound for multivariate functions in
global optimization, Math. Comput. Simul. 109 (2015) 197–211.
[17] J. Pierezan, L. S. Coelho, Coyote Optimization Algorithm: A new metaheuristic for global optimization
problems, IEEE Congress on Evolutionary Computation, (2018) 2633–2640.
[18] M. Rahal, A. Ziadi, A new extension of Piyavskii’s method to Hlder functions of several variables, Appl.
math. Comput. 197 (2008) 478–488.
[19] B.L. Robertson, C.J. Price, M. Reale. A CARTopt method for bound-constrained global optimization, The
ANZIAM Journal 55 (2013) 109–128.
[20] A. Sahiner, S.A. Ibrahem, A new global optimization technique by auxiliary function method in a directional
search, Optim. Lett. 13 (2019) 309–323.
[21] M. Salahi, A. Jamalian, A. Taati, Global minimization of multi-funnel functions using particle swarm opti-
mization, Neural. Comput. Appl. 23 (2013) 2101–2106.
[22] R. Storn, K. Price, Differential evolution - a simple and efficient heuristic for global optimization over con-
tinuous spaces, J. Glob. Opt. 11 (1997) 341–359.
[23] S. Surjanovic, D. Bingham, Virtual Library of Simulation Experiments: Test Functions and Datasets, Re-
trieved January 28, 2023, from http://www.sfu.ca/ ssurjano/index.html, (2013).
[24] M. Zambrano-Bigiarini, C. Maurice, R. Rodrigo, Standard particle swarm optimisation: A baseline for future
pso improvements, IEEE Congress on Evolutionary Computation, 2013.
[25] A. Ziadi, Y. Cherruault, Generation of α-dense curves and application to global optimization, Kybernetes 29
(2000) 71–82.
[26] A. Ziadi, Y. Cherruault, G. Mora, Global optimization: A new variant of the Alienor method, Comput. Math.
Appl. 41 (2001) 63–71.

[27] R. Ziadi, A. Bencherif-Madani, R. Ellaia, Continuous global optimization through the generation of para-
metric curves, Appl. Math. Comp. 282 (2016) 65–83.
[28] R. Ziadi, R. Ellaia, A. Bencherif-Madani, Global optimization through a stochastic perturbation of the Polak-
Ribi`ere conjugate gradient method, J. Comput. Appl. Math. 317 (2017) 672–684.
[29] R. Ziadi, A. Bencherif-Madani, A covering method for continuous global optimization, Int. Jour. Comput.
Sci. Math. 13 (2021) 369–390.
[30] R. Ziadi, A. Bencherif-Madani, R. Ellaia, A deterministic method for continuous global optimization using a
dense curve, Math. Comput. Simul. 178 (2020) 62–91.