Two Algorithms for Solving Unconstrained Global Optimization by Auxiliary Function Method

Main Article Content

Shehab Ahmed Ibrahem
Isam Haider Halil
Suaad Madhat Abdullah

Abstract

In this paper, we present two algorithms that are designed to solve unconstrained global optimization problems. The first algorithm is introduced for resolving unconstrained optimization problems by dividing a multidimensional problem into partitions of a one-dimensional problem and subsequently identifying a global minimizer for each partition by utilizing an auxiliary function and then using it to find the global minimizer of a multidimensional problem. In the second algorithm, the same auxiliary function is used to find a global minimizer of the same multidimensional problem without partitioning it. Finally, we apply these algorithms to common test problems and compare them to each other to show the efficiency of the algorithms

Article Details

How to Cite
Ibrahem, S. A., Isam Haider Halil, & Suaad Madhat Abdullah. (2024). Two Algorithms for Solving Unconstrained Global Optimization by Auxiliary Function Method. Tikrit Journal of Pure Science, 29(3), 84–89. https://doi.org/10.25130/tjps.v29i3.1604
Section
Articles

References

[1] Sahiner, A. and Ibrahem, S. A. (2019). A new global optimization technique by auxiliary function method in a directional search. Optimization Letters, 13(2): 309-323.

[2] Kara, G.; Özmen, A. and Weber, G. W. (2019). Stability advances in robust portfolio optimization under parallelepiped uncertainty. Central European Journal of Operations Research, 27: 241-261.

[3] Gharehchopogh, F. S. (2022). An improved tunicate swarm algorithm with best-random mutation strategy for global optimization problems. Journal of Bionic Engineering, 19(4): 1177-1202.

[4] Yilmaz, N. and Sahiner, A. (2017). New global optimization method for non-smooth unconstrained continuous optimization. AIP Conference Proceedings, 1863(1): 250002.

[5] Sahiner, A.; Yilmaz, N. and Ibrahem, S. A. (2018). Smoothing Approximations to Nonsmooth Functions. Journal of Multidisciplinary Modeling and Optimization, 1(2): 69-74.

[6] Naji, A. J.; Ibrahem S. A. and Umar, U. S. (2023). Improved image segmentation method based on optimized higher-order polynomial. International Journal of Nonlinear Analysis and Applications, 14(1), 2701-2715.

[7] Rmaidh, M. I. and Ibrahim, S. A. (2023). A New Method for Solving Image Segmentation Problems using Global Optimization. International Journal of Intelligent Systems and Applications in Engineering, 11(5): 85-92.

[8] Sahiner, A.; Abdulhamid, I. A. M. and Ibrahem, S. A. (2019). A new filled function method with two parameters in a directional search. Journal of

Multidisciplinary Modeling and Optimization, 2(1): 34-42.

[9] El-Gindy, T. M.; Salim, M. S. and Ahmed, A. I. (2016). A new filled function method applied to unconstrained global optimization. Applied mathematics and computation, 273: 1246-1256.

[10] Sahiner, A.; Ibrahem, S. A. and Yilmaz, N. (2020). Increasing the Effects of Auxiliary Function by Multiple Extrema in Global Optimization. In Numerical Solutions of Realistic Nonlinear Phenomena, 125-143.

[11] Liu, H.; Xue, S.; Cheng, Y. and Tuo, S. (2022). A New Parameterless Filled Function Method for Global Optimization. Axioms, 11(12): 746.

[12] Jureczka, M. and Ochal, A. (2021). A nonsmooth optimization approach for hemivariational inequalities with applications to contact mechanics. Applied Mathematics & Optimization, 83: 1465-1485.

[13] Hassan, B. A.; Jabbar, H. N. and Laylani, Y. A. (2023). Upscaling Parameters for Conjugate Gradient Method in Unconstrained Optimization. Journal of Interdisciplinary Mathematics, 26(6): 1171-1180.

[14] Pandiya, R.; Widodo, W. and Endrayanto, I. (2021). Non parameter-filled function for global optimization. Applied Mathematics and Computation, 391: 125642.

[15] Hedar, A. Test functions for unconstrained global optimization. (2013). http://www-optima.amp.i.kyoto-u.ac.jp/member/student/hedar/Hedar_files/TestGO_files/Page364.htm