GFS algorithm based on batch Monte Carlo trials for solving global optimization problems
A new method for global optimization of Hölder goal functions under compact sets given by inequalities is proposed. All functions are defined only algorithmically. The method is based on performing simple Monte Carlo trials and constructing the sequences of records and the sequence of their decrements. An estimating procedure of Hölder constants is proposed. Probability estimation of exact global minimum neighborhood using Hölder constants estimates is presented. Results on some analytical and algorithmic test problems illustrate the method’s performance.
Статья в сборнике трудов международной научной конференции: "Twelfth Asia-Pacific International Conference on Gravitation, Astrophysics, and Cosmology Dedicated to the Centenary of Einstein’s General Relativity".