Abstract
In global optimization, a typical population-based stochastic search method works on a set of sample points from the feasible region. In this paper, we study a recently proposed method of this sort. The method utilizes an attraction-repulsion mechanism to move sample points toward optimality and is thus referred to as electromagnetism-like method (EM). The computational results showed that EM is robust in practice, so we further investigate the theoretical structure. After reviewing the original method, we present some necessary modifications for the convergence proof. We show that in the limit, the modified method converges to the vicinity of global optimum with probability one.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baba, N. (1981), Convergence of a random optimization method for constrained optimization problems, Journal of Optimization Theory and Applications 33, 451-461.
Birbil, Ş. İ. and Fang, S.-C. (2002), An electromagnetism-like mechanism for global optimization, Journal of Global Optimization, 25(3), 263-282.
Birbil, Ş. İ. (2002), Stochastic global optimization techniques, PhD Thesis, North Carolina State University, Raleigh, NC.
Dekkers, A. and Aarts, E. (1991), Global optimization and simulated annealing, Mathematical Programming 50, 367-393.
Fogel, D. B. (1994), Asymptotic convergence properties of genetic algorithms and evolutionary programming, Cybernetics and Systems 25(3), 389-407.
Hart, W. E. (1994), Adaptive global optimization with local search, PhD Thesis, University of California, San Diego, CA.
Huyer, W. and Neumaier, A. (1999), Global optimization by multilevel coordinate search, Journal of Global Optimization 14, 331-355.
Ingber, L. (1994), Simulated annealing: practice versus theory, Journal of Mathematical Computation Modeling 18, 29-57.
Kan, A. H. G. R. and Timmer, G. T. (1987), Stochastic global optimization methods Part II: Multi level methods, Mathematical Programming 39, 57-78.
Law, A. M. and Kelton, W. D. (2000), Simulation Modeling and Analysis, 3rd Edition, McGraw-Hill, Inc., New York.
Michalewic, Z. (1994), Genetic Algorithms + Data Structures = Evolution Programs, Springer, Berlin.
Moré, J. J. and Wu, Z. (1995), Global smoothing and continuation for large-scale molecular optimization, Argonne National Laboratory, Illinois: Preprint MCS-P539-1095.
Pintér, J. (1984), Convergence properties of stochastic optimization procedures, Optimization 15, 405-427.
Rudolph, G. (1996), Convergence of evolutionay algorithms in general search spaces. In: International Conference on Evolutionary Computation, pp. 50-54.
Schoen, F. (1989), A wide class of test functions for global optimization. In: Proceedings of the 3rd International Conference on Genetic Algorithms, pp. 51-60.
Taylor, H. M. and Karlin, S. M. (1998), An Introduction to Stochastic Modeling, Academic Press, San Diego, CA.
Törn, A., Ali, M. M. and Viitanen, S. (1999), Stochastic global optimization: Problem classes andsolution techniques, Journal of Global Optimization 14, 437-447.
Wood, G. R. (1991), Multidimensional bisection and global optimization, Computer and Mathematics with Applications 21, 161-172.
Yakowitz, S. J. and Fisher, L. (1973), On sequential search for the maximum of an unknown function, Journal of Mathematical Analysis and Applications 41, 234-259.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Birbil, Ş.İ., Fang, SC. & Sheu, RL. On the Convergence of a Population-Based Global Optimization Algorithm. J Glob Optim 30, 301–318 (2004). https://doi.org/10.1007/s10898-004-8270-3
Issue Date:
DOI: https://doi.org/10.1007/s10898-004-8270-3