Abstract A parallel algorithm for solving multiextremal multidimensional global optimization problems is proposed. The algorithm is based on reducing multidimensional problems to the one-dimensional ones by applying Peano-type space-filling curves. A new parallel scheme to construct such curves is presented. For reduced optimization problems a parallel global optimization method is constructed. Sufficient conditions of global convergence are investigated. Conditions, which guarantee considerable speedup with respect to the sequential version of the algorithm, are established. Numerical experiments executed on ALLIANT FX/80 are also presented.
[1]
R. G. Strongin,et al.
A global minimization algorithm with parallel iterations
,
1990
.
[2]
Marida Bertocchi.
A parallel algorithm for global optimization 1
,
1990
.
[3]
Alexander H. G. Rinnooy Kan,et al.
Concurrent stochastic methods for global optimization
,
1990,
Math. Program..
[4]
Elizabeth Eskow,et al.
Mathematical modeling of a parallel global optimization algorithm
,
1989,
Parallel Comput..
[5]
Arthur R. Butz,et al.
Space Filling Curves and Mathematical Programming
,
1968,
Inf. Control..