Answers are grounded in this paper and cite their sources.
In this paper we present a new sequential algorithm for solving one-dimensional and multidimensional (using Peano-type space filling curves for reduction of the dimensionality) multiextremal global optimization problems. A parallel version of the algorithm is also described. Sufficient conditions for global convergence are proved for both the methods. Numerical experiments are also presented.
No takes yet. Share an insight, caveat, or question.
Sergeyev et al. (1994) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: