Convergence qualification of adaptive partition algorithms in global optimization

Following the presentation of a general partition algorithm scheme for seeking the globally best solution in multiextremal optimization problems, necessary and sufficient convergence conditions are formulated, in terms of respectively implied or postulated properties of the partition operator. The convergence results obtained are pertinent to a number of deterministic algorithms in global optimization, permitting their diverse modifications and generalizations.