In this paper we propose a new parallel algorithm for solving global optimization (GO) multidimensional problems. The method unifies two powerful approaches for accelerating the search: parallel computations and local tuning on the behavior of the objective function. We establish convergence conditions for the algorithm and theoretically show that the usage of local information during the global search permits to accelerate solving the problem significantly. Results of numerical experiments executed with 100 test functions are also reported.
@article{arxiv.1103.6006,
title = {Parallel Information Algorithm with Local Tuning for Solving Multidimensional GO Problems},
author = {Yaroslav D. Sergeyev},
journal= {arXiv preprint arXiv:1103.6006},
year = {2011}
}