论文信息 - Parallel Branch and Bound Algorithm with Combination of Lipschitz Bounds over Multidimensional Simplices for Multicore Computers

Parallel Branch and Bound Algorithm with Combination of Lipschitz Bounds over Multidimensional Simplices for Multicore Computers

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.

Remigijus Paulavičius | Julius Žilinskas

[1] Panos M. Pardalos,et al. Introduction to Global Optimization , 2000, Introduction to Global Optimization.

[2] J. Zilinskas,et al. Analysis of different norms and corresponding Lipschitz constants for global optimization in multidi , 2007 .

[3] Julius Žilinskas,et al. Branch and bound with simplicial partitions for global optimization , 2008 .

[4] Reiner Horst,et al. Introduction to Global Optimization (Nonconvex Optimization and Its Applications) , 2002 .

[5] P. Pardalos,et al. Handbook of global optimization , 1995 .

[6] Remigijus Paulavičius,et al. Analysis of different norms and corresponding Lipschitz constants for global optimization in multidi , 2007 .