Cite this article as:
Savin A. N. The parallel variant of conditional optimization algorithm with Box complex method . Izv. Saratov Univ. (N. S.), Ser. Math. Mech. Inform., 2012, vol. 12, iss. 3, pp. 109-117. DOI: https://doi.org/10.18500/1816-9791-2012-12-3-109-117
The parallel variant of conditional optimization algorithm with Box complex method
This article presents the results of the adaptation algorithm for global extremum searching with presence explicit and implicit constraints complex method created by Box for systems of the distributed and parallel computing. The optimal count of nodes of computing system from the point of view of reliability a global extremum finding and time of its search is defined. At the same time, the run time was several times smaller than on one computer and reliability of searching the global extremum is much higher due to the simultaneous researching of the target function in several areas of the factor space.
