Parallel Global Optimization for Non-convex Mixed-Integer Problems

The paper considers the mixed-integer global optimization problems. A novel parallel algorithm for solving the problems of this class based on the index algorithm for solving the continuous global optimization problems has been proposed. The comparison of this algorithm with known analogs demonstrates the efficiency of the developed approach. The proposed algorithm allows an efficient parallelization including the employment of the graphics accelerators. The results of performed numerical experiments (solving a series of 100 multiextremal mixed-integer problems) confirm a good speedup of the algorithm with the use of GPU.

[1]  Prajwal S. Prakasha,et al.  Optimization of BWB Aircraft Using Parallel Computing , 2018, Supercomput. Front. Innov..

[2]  Roman G. Strongin,et al.  Solving a set of global optimization problems by the parallel technique with uniform convergence , 2017, Journal of Global Optimization.

[3]  Roman G. Strongin,et al.  Introduction to Global Optimization Exploiting Space-Filling Curves , 2013 .

[4]  Julius Zilinskas,et al.  Globally-biased Disimpl algorithm for expensive global optimization , 2014, Journal of Global Optimization.

[5]  Yaroslav D. Sergeyev,et al.  A deterministic global optimization using smooth diagonal auxiliary functions , 2015, Commun. Nonlinear Sci. Numer. Simul..

[6]  Yaroslav D. Sergeyev,et al.  Algorithm 829: Software for generation of classes of test functions with known local and global minima for global optimization , 2003, TOMS.

[7]  Victor P. Gergel,et al.  A Two-Level Parallel Global Search Algorithm for Solution of Computationally Intensive Multiextremal Optimization Problems , 2015, PaCT.

[8]  Adam N. Letchford,et al.  Non-convex mixed-integer nonlinear programming: A survey , 2012 .

[9]  Victor Gergel,et al.  Heterogeneous Parallel Computations for Solving Global Optimization Problems1 , 2015 .

[10]  Julio R. Banga,et al.  Extended ant colony optimization for non-convex mixed integer nonlinear programming , 2009, Comput. Oper. Res..

[11]  Leo Liberti,et al.  Branching and bounds tighteningtechniques for non-convex MINLP , 2009, Optim. Methods Softw..

[12]  Roman G. Strongin,et al.  Multidimensional Parallel Algorithms , 2000 .

[13]  Ilya Lebedev,et al.  Solving global optimization problems on GPU cluster , 2016 .

[14]  Ambros M. Gleixner,et al.  SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework , 2018, Optim. Methods Softw..

[15]  Y. D. Sergeyev,et al.  Global Optimization with Non-Convex Constraints - Sequential and Parallel Algorithms (Nonconvex Optimization and its Applications Volume 45) (Nonconvex Optimization and Its Applications) , 2000 .

[16]  Vladislav Sovrasov,et al.  Comparison of Several Stochastic and Deterministic Derivative-Free Global Optimization Algorithms , 2019, MOTOR.

[17]  Christodoulos A. Floudas,et al.  Global optimization advances in Mixed-Integer Nonlinear Programming, MINLP, and Constrained Derivative-Free Optimization, CDFO , 2016, Eur. J. Oper. Res..

[18]  A. V. Sulimov,et al.  Supercomputer Docking: Investigation of Low Energy Minima of Protein-Ligand Complexes , 2018, Supercomput. Front. Innov..

[19]  Kusum Deep,et al.  A real coded genetic algorithm for solving integer and mixed integer optimization problems , 2009, Appl. Math. Comput..

[20]  Victor P. Gergel,et al.  Parallel global optimization on GPU , 2016, Journal of Global Optimization.