On the convergence of adaptive partition algorithms in global optimization

A broad class of adaptive partition algorithms has been introduced in an earlier paper for finding the global minimize r(s) of a multiextremal Lipschitz-continuous function defined on an n-dimensional interval feasible region. Zilinskas claims that the general convergence result (Theorem 2.1) given there is not correct, providing a (false) counterexample. Besides showing the fallacy of his argumentation, some additional points on the subject of convergent partition strategies are also summarized.