To refer to this page use:
|Abstract:||This paper introduces the global mixed-integer quadratic optimizer, GloMIQO, a numerical solver addressing mixed-integer quadratically-constrained quadratic programs to 𝜀-global optimality. The algorithmic components are presented for: reformulating user input, detecting special structure including convexity and edge-concavity, generating tight convex relaxations, partitioning the search space, bounding the variables, and finding good feasible solutions. To demonstrate the capacity of GloMIQO, we extensively tested its performance on a test suite of 399 problems of diverse size and structure. The test cases are taken from process networks applications, computational geometry problems, GLOBALLib, MINLPLib, and the Bonmin test set. We compare the performance of GloMIQO with respect to four state-of-the-art global optimization solvers: BARON 10.1.2, Couenne 0.4, LindoGLOBAL 22.214.171.1248, and SCIP 2.1.0.|
|Citation:||Misener, Ruth, and Christodoulos A. Floudas. "GloMIQO: Global mixed-integer quadratic optimizer." Journal of Global Optimization 57, no. 1 (2013): 3-50. doi: 10.1007/s10898-012-9874-7|
|Pages:||3 - 50|
|Type of Material:||Journal Article|
|Journal/Proceeding Title:||Journal of Global Optimization|
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.