Parallel branch and bound algorithm with combination of lipschitz bounds over multidimensional simplices for multicore computers

Abstract

Parallel branch and bound for global Lipschitz minimization is considered. A combination of extreme (infinite and first) and Euclidean norms over a multidimensional simplex is used to evaluate the lower bound. OpenMP has been used to implement the parallel version of the algorithm for multicore computers. The efficiency of the developed parallel algorithm is investigated solving multidimensional test functions for global optimization.