A Parallel Bernstein Algorithm for Global Optimization Based on the Implicit Bernstein Form

In this paper, we first present a serial Bernstein algorithm for polynomial global optimization based on the Implicit Bernstein Form (IBF) (Smith in J Glob Optim 43:445–458, 2009 ). The serial Bernstein algorithm based on IBF needs less computations and memory than the conventional Bernstein algorithm and its variants. To accelerate further the Bernstein algorithm based on the IBF, we next propose a parallel version for GPU computing using Compute Unified Device Architecture. With the parallel version, the exponential time-complexity of the serial algorithm reduces to linear time-complexity. We compare the performance of both the versions on a set of 12 test problems, and find that the parallel version is up to 26 times faster and takes 96% less time than the serial one. Based on these findings, we suggest the use of the parallel version of the Bernstein algorithm based on IBF in polynomial global optimization.