PARALLEL COMPUTING IN MULTIEXTREMAL OPTIMIZATION PROBLEMS |
6 | |
2009 |
scientific article | 519.853.4 | ||
171-177 | multiextremal optimization, nonconvex constraints, Peano curves, parallel algorithms |
A parallel algorithm for solving multiextremal optimization problems with nonconvex constraints has been considered. It is based on the reduction of an initial multidimensional problem to a set of related one-dimensional ones. A new scheme to construct a set of Peano space-filling curves has been proposed. The scheme preserves some information on the closeness of points in the multidimensional space. The results of numerical experiments have been presented to show the algorithm convergence acceleration using the new scheme of multiple curve construction. |
![]() |