A mixed algorithm for smooth global optimization

Document Type : Research Article

Authors

Laboratory of Fundamental and Numerical ‎Mathematics (LMFN), Department of Mathematics, University Ferhat Abbas Setif 1, 19000 ‎Setif, Algeria

Abstract

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.

Keywords

References

[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, Applied Numerical Mathematics, vol. 181, pp. 618–629, 2022.
[3] P. Brachetti, M.D.F. Ciccoli, G.D. Pillo, S. Lucidi, A new version of the Price’s algorithm for global optimization, Journal of Global Optimization, vol. 10, pp. 165–184, 1997.
[4] R.H. Byrd, P. Lu, J. Nocedal, C. Zhu, A limited memory algorithm for bound constrained optimization, SIAM Journal on Scientific Computing, vol. 16, pp. 1190–1208, 1995.
[5] Y. Cherruault, A. Guillez, Une méthode pour la recherche du minimum global d’une fonctionnelle, C. R. Acad. Sci. Paris, vol. 296, pp. 175–178, 1983.
[6] W. Deng, J. Xu, X.Z. Gao, H. Zhao, An enhanced MSIQDE algorithm with novel multiple strategies for global optimization problems, IEEE Transactions on Systems, Man, and Cybernetics, vol. 52, pp. 1578–1587, 2020.
[7] Y.G. Evtushenko, Numerical Optimization Techniques, Berlin: Springer, 1985.
[8] R. Ellaia, M.Z. Es-Sadek, H. Kasbioui, Modified Piyavskii’s global one-dimensional optimization of a differentiable function, Applied Mathematics, vol. 3, pp. 1306–1320, 2012.
[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 Computing, vol. 25, pp. 2325–2350, 2021.
[10] A. Faramarzi, M. Heidarinejad, B. Stephens, S. Mirjalili, Equilibrium optimizer: A novel optimization algorithm, Knowledge-Based Systems, vol. 191, p. 105190, 2020.
[11] Z.W. Geem, J.H. Kim, G.V. Loganathan, A new heuristic optimization algorithm: harmony search, Simulation, vol. 76, pp. 60–68, 2001.
[12] D. Guettal, A. Ziadi, Reducing transformation and global optimization, Applied Mathematics and Computation, vol. 218, pp. 5848–5860, 2012.
[13] W. Huyer, A. Neumaier, Global optimization by multilevel coordinate search, Journal of Global Optimization, vol. 14, pp. 331–355, 1999.
[14] N. Keskar, A. Wächter, A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization, Optimization Methods and Software, vol. 34, pp. 150–171, 2019.
[15] A. Kumar, R.K. Misra, D. Singh, S. Mishra, S. Das, The spherical search algorithm for bound-constrained global optimization problems, Applied Soft Computing, vol. 85, p. 105734, 2019.
[16] M. Ouanes, H.A. Le Thi, T.P. Nguyen, A. Zidna, New quadratic lower bound for multivariate functions in global optimization, Mathematics and Computers in Simulation, vol. 109, pp. 197–211, 2015.
[17] J. Pierezan, L.S. Coelho, Coyote Optimization Algorithm: A new metaheuristic for global optimization problems, in IEEE Congress on Evolutionary Computation, pp. 2633–2640, 2018.
[18] M. Rahal, A. Ziadi, A new extension of Piyavskii’s method to Hölder functions of several variables, Applied Mathematics and Computation, vol. 197, pp. 478–488, 2008.
[19] B.L. Robertson, C.J. Price, M. Reale, A CARTopt method for bound-constrained global optimization, The ANZIAM Journal, vol. 55, pp. 109–128, 2013.
[20] A. Sahiner, S.A. Ibrahem, A new global optimization technique by auxiliary function method in a directional search, Optimization Letters, vol. 13, pp. 309–323, 2019.
[21] M. Salahi, A. Jamalian, A. Taati, Global minimization of multi-funnel functions using particle swarm optimization, Neural Computing and Applications, vol. 23, pp. 2101–2106, 2013.
[22] R. Storn, K. Price, Differential evolution – a simple and efficient heuristic for global optimization over continuous spaces, Journal of Global Optimization, vol. 11, pp. 341–359, 1997.
[23] S. Surjanovic, D. Bingham, Virtual Library of Simulation Experiments: Test Functions and Datasets, retrieved 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, in IEEE Congress on Evolutionary Computation, 2013.
[25] A. Ziadi, Y. Cherruault, Generation of α-dense curves and application to global optimization, Kybernetes, vol. 29, pp. 71–82, 2000.
[26] A. Ziadi, Y. Cherruault, G. Mora, Global optimization: A new variant of the Alienor method, Computers & Mathematics with Applications, vol. 41, pp. 63–71, 2001.
[27] R. Ziadi, A. Bencherif-Madani, R. Ellaia, Continuous global optimization through the generation of parametric curves, Applied Mathematics and Computation, vol. 282, pp. 65–83, 2016.
[28] R. Ziadi, R. Ellaia, A. Bencherif-Madani, Global optimization through a stochastic perturbation of the Polak-Ribière conjugate gradient method, Journal of Computational and Applied Mathematics, vol. 317, pp. 672–684, 2017.
[29] R. Ziadi, A. Bencherif-Madani, A covering method for continuous global optimization, International Journal of Computing Science and Mathematics, vol. 13, pp. 369–390, 2021.
[30] R. Ziadi, A. Bencherif-Madani, R. Ellaia, A deterministic method for continuous global optimization using a dense curve, Mathematics and Computers in Simulation, vol. 178, pp. 62–91, 2020.
Journal of Mathematical Modeling
Volume 11, Issue 2
July 2023
Pages 207-228

Files

Share

How to cite

Statistics