A New Integral Function Algorithm for Global Optimization and Its Application to the Data Clustering Problem
Abstract
The filled function method is an approach to finding global minimum points of multidimensional unconstrained global optimization problems. The conventional parametric filled functions have computational weaknesses when they are employed in some benchmark optimization functions. This paper proposes a new integral function algorithm based on the auxiliary function approach. The proposed method can successfully be used to find the global minimum point of a function of several variables. Some testing global optimization problems have been used to show the ability of this recommended method. The integral function algorithm is then implemented to solve the center-based data clustering problem. The results show that the proposed algorithm can solve the problem successfully.
References
Ahmed, A. A new filled function for global minimization and system of nonlinear equations. Optimization 71 (2022), 4083–4106.
Dhillon, I., Mallela, S., and Kumar, R. A divisive information-theoretic feature clustering algorithm for text classification. Journal of Machine Learning Research 3 (2003), 1265–1287.
El-Gindy, T., Salim, M., and Ahmed, A. A new filled function method applied to unconstrained global optimization. Applied Mathematics and Computation 273 (2016), 1246–1256.
Gao, Y., Yang, Y., and You, M. A new filled function method for global optimization. Applied Mathematics and Computation 268 (2015), 268–695.
Gaviano, M., Kvasov, D. E., Lera, D., and Sergeyev, Y. D. Algorithm 829: Software for generation of classes of test functions with known local and global minima for global optimization. ACM Transactions on Mathematical Software 29 (2003), 469–480.
Ge, R. The theory of filled function method for finding global minimizers of nonlinearly constrained minimization problems. Journal of Computational Mathematics 5 (1987), 1–9.
Ge, R. A filled function method for finding a global minimizer of a function of several variables. Mathematical Programming 46 (1990), 191–204.
Ge, R., and Qin, Y. A class of filled functions for finding global minimizers of a function of several variables. Journal of Optimization Theory and Applications 54 (1987), 241–252.
Hansen, N., Auger, A., Finck, S., and Ros, R. Real parameter black-box optimization benchmarking 2012: Experimental setup. Technical Report. INRIA 6829, 2012.
Jin, Y., Wang, H., Chugh, T., Guo, D., and Miettinen, K. K data-driven evolutionary optimization: An overview and case studies. IEEE Transactions on Evolutionary Computation 23 (2018), 442–458.
Jones, D. R., and Martins, J. R. The direct algorithm: 25 years later. Journal of Global Optimization 79 (2021), 521–566.
Kanagaraj, G., Masthan, S. S., and Yu, V. F. Meta-heuristics based inverse kinematics of robot manipulator’s path tracking capability under joint limits. Mendel 28 (2022), 41–54.
Kudela, J. Novel zigzag-based benchmark functions for bound constrained single objective optimization. In 2021 IEEE Congress on Evolutionary Computation (CEC) (2021), pp. 857–862.
Kudela, J. A critical problem in benchmarking and analysis of evolutionary computation methods. Nature Machine Intelligence 4 (2022), 1238–1245.
Kudela, J. Benchmarking state-of-the-art direct-type methods on the bbob noiseless testbed. In GECCO ’23 Companion: Proceedings of the Companion Conference on Genetic and Evolutionary Computation (2023), pp. 1620–1627.
Kudela, J., and Juricek, M. Computational and exploratory landscape analysis of the gkls generator. In GECCO ’23 Companion: Proceedings of the Companion Conference on Genetic and Evolutionary Computation (2023), pp. 443–446.
Kudela, J., and Matousek, R. New benchmark functions for single-objective optimization based on a zigzag pattern. IEEE Access 10 (2022), 8262–8278.
Kudela, J., and Matousek, R. Recent advances and applications of surrogate models for finite element method computations: A review. Soft Computing 26 (2022), 13709–13733.
Lampariello, F., and Liuzzi, G. A filling function method for unconstrained global optimization. Computational Optimization and Applications 61 (2015), 713–729.
LaTorre, A., Molina, D., Osaba, E., Poyatos, J., Ser, J. D., and Herrera, F. A prescription of methodological guidelines for comparing bio-inspired optimization algorithms. Swarm and Evolutionary Computation 67 (2021), 100973.
Li, J., Shang, Y., and Han, P. New tunnelfilled function method for discrete global optimization. Journal of the Operations Research Society of China 5 (2017), 291–300.
Lin, H., Gao, Y., Wang, X., and Su, S. A filled function which has the same local minimizer of the objective function. Optimization Letters 13 (2018), 761–776.
Lin, H., Wang, Y., Gao, Y., and Wang, X. A filled function method for global optimization with inequality constraints. Computational and Applied Mathematics 37 (2018), 1524–1536.
Liu, H., Wang, Y., Guan, S., and Liu, X. A new filled function method for unconstrained global optimization. International Journal of Computer Mathematics 94 (2017), 2283–2296.
Ma, S., and Gao, Y. Parameter-free filled function method for nonlinear integer program. Journal of Industrial & Management Optimization 19 (2023), 6835–6855.
Ma, S., Yang, Y., and Liu, H. A parameter free filled function for unconstrained global optimization. Applied Mathematics and Computation 215 (2010), 3610–3619.
Muller, J. Improving initial aerofoil geometry using aerofoil particle swarm optimisation. Mendel 28 (2022), 63–67.
Pandiya, R., Salmah, Widodo, W., and Endrayanto, I. A novel parameter-free filled function applied to global optimization. Engineering Letters 29 (2021), 191–200.
Sabo, K., Scitovski, R., and Vazler, I. Onedimensional center-based l1-clustering method. Optimization Letters 7 (2013), 5–22.
Sabo, K., Scitovski, R., Vazler, I., and Zekic-Susac, M. Mathematical models of natural gas consumption. Energy Conversion and Management 52 (2011), 1721–1727.
Stripinis, L., and Paulaviˇcius, R. Lipschitzinspired halrect algorithm for derivative-free global optimization. Journal of Global Optimization (2023).
Tang, J., Wang, W., and Xu, Y. Lower-order smoothed objective penalty functions based on filling properties for constrained optimization problems. Optimization 71 (2022), 1601, 2022.
Yang, Y., and Shang, Y. A new filled function method for unconstrained global optimization. Applied Mathematics and Computation 173 (2006), 501–512.
Copyright (c) 2023 MENDEL
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
MENDEL open access articles are normally published under a Creative Commons Attribution-NonCommercial-ShareAlike (CC BY-NC-SA 4.0) https://creativecommons.org/licenses/by-nc-sa/4.0/ . Under the CC BY-NC-SA 4.0 license permitted 3rd party reuse is only applicable for non-commercial purposes. Articles posted under the CC BY-NC-SA 4.0 license allow users to share, copy, and redistribute the material in any medium of format, and adapt, remix, transform, and build upon the material for any purpose. Reusing under the CC BY-NC-SA 4.0 license requires that appropriate attribution to the source of the material must be included along with a link to the license, with any changes made to the original material indicated.
