This paper address the global optimization problem of polynomial mixed-integer nonlinear programs (MINLPs). A improved branch-and-prune algorithm based on the Bernstein form is proposed to solve such MINLPs. The algorithm use a new pruning feature based on the Bernstein form, called the Bernstein box and Bernstein hull consistency. The proposed algorithm is tested on a set of 16 MINLPs chosen from the literature. The efficacy of the proposed algorithm is brought out via numerical studies with the previously reported Bernstein algorithms and several state-of-the-art MINLP solvers.
CITATION STYLE
Patil, B. V. (2016). The bernstein branch-and-prune algorithm for constrained global optimization of multivariate polynomial MINLPs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9582, pp. 560–575). Springer Verlag. https://doi.org/10.1007/978-3-319-32859-1_48
Mendeley helps you to discover research relevant for your work.