On the Convergence of a Population‐Based Global Optimization Algorithm

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.