Parallelization of the global extremum searching process

Authors:
Yu. G. Evtushenko;V. U. Malkova;A. A. Stanevichyus
Affiliations:
Dorodnitsyn Computer Center, Russian Academy of Sciences, Moscow, Russia;Dorodnitsyn Computer Center, Russian Academy of Sciences, Moscow, Russia;Dorodnitsyn Computer Center, Russian Academy of Sciences, Moscow, Russia
Venue:
Automation and Remote Control
Year:
2007

Citing 1
Cited 1

Global Optimization with Non-Convex Constraints - Sequential and Parallel Algorithms (Nonconvex Optimization and its Applications Volume 45) (Nonconvex Optimization and Its Applications)

Global Optimization with Non-Convex Constraints - Sequential and Parallel Algorithms (Nonconvex Optimization and its Applications Volume 45) (Nonconvex Optimization and Its Applications)

Nonuniform covering method as applied to multicriteria optimization problems with guaranteed accuracy

Computational Mathematics and Mathematical Physics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The parallel algorithm for searching the global extremum of the function of several variables is designed. The algorithm is based on the method of nonuniform coverings proposed by Yu.G. Evtushenko for functions that comply with the Lipschitz condition. The algorithm is realized in the language C and message passing interface (MPI) system. To speed up computations, auxiliary procedures for founding the local extremum are used. The operation of the algorithm is illustrated by the example of atomic cluster structure calculations.