ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations. This manuscript introduces ANTIGONE, Algorithms for coNTinuous/Integer Global Optimization of Nonlinear Equations, a general mixed-integer nonlinear global optimization framework. ANTIGONE is the evolution of the Global Mixed-Integer Quadratic Optimizer, GloMIQO, to general nonconvex terms. The purpose of this paper is to show how the extensible structure of ANTIGONE realizes our previously-proposed mixed-integer quadratically-constrained quadratic program and mixed-integer signomial optimization computational frameworks. To demonstrate the capacity of ANTIGONE, this paper presents computational results on a test suite of 2,571 problems from standard libraries and the open literature; we compare ANTIGONE to other state-of-the-art global optimization solvers.

References in zbMATH (referenced in 30 articles )

Showing results 1 to 20 of 30.
Sorted by year (citations)

1 2 next

  1. Kılınç, Mustafa R.; Sahinidis, Nikolaos V.: Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON (2018)
  2. Schweiger, Jonas: Exploiting structure in non-convex quadratic optimization and gas network planning under uncertainty (2018)
  3. Vigerske, Stefan; Gleixner, Ambros: SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework (2018)
  4. Zhou, Kai; Kılınç, Mustafa R.; Chen, Xi; Sahinidis, Nikolaos V.: An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver (2018)
  5. Andrea Callia D’Iddio, Michael Huth: Manyopt: An Extensible Tool for Mixed, Non-Linear Optimization Through SMT Solving (2017) arXiv
  6. Bongartz, Dominik; Mitsos, Alexander: Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations (2017)
  7. Boukouvala, Fani; Faruque Hasan, M. M.; Floudas, Christodoulos A.: Global optimization of general constrained grey-box models: new method and its application to constrained PDEs for pressure swing adsorption (2017)
  8. Boukouvala, Fani; Floudas, Christodoulos A.: ARGONAUT: algorithms for global optimization of constrained grey-box computational problems (2017)
  9. Buchheim, Christoph; D’Ambrosio, Claudia: Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization (2017)
  10. Gerard, D.; Köppe, M.; Louveaux, Q.: Guided dive for the spatial branch-and-bound (2017)
  11. Gleixner, Ambros M.; Berthold, Timo; Müller, Benjamin; Weltge, Stefan: Three enhancements for optimization-based bound tightening (2017)
  12. Harwood, Stuart M.; Barton, Paul I.: How to solve a design centering problem (2017)
  13. Kallrath, Josef: Packing ellipsoids into volume-minimizing rectangular boxes (2017)
  14. Khan, Kamil A.; Watson, Harry A. J.; Barton, Paul I.: Differentiable McCormick relaxations (2017)
  15. Lee, Jon; Skipper, Daphne: Virtuous smoothing for global optimization (2017)
  16. Lima, Ricardo M.; Grossmann, Ignacio E.: On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (2017)
  17. Puranik, Yash; Sahinidis, Nikolaos V.: Domain reduction techniques for global NLP and MINLP optimization (2017)
  18. Puranik, Yash; Sahinidis, Nikolaos V.: Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (2017)
  19. Speakman, Emily; Yu, Han; Lee, Jon: Experimental validation of volume-based comparison for double-McCormick relaxations (2017)
  20. Araya, Ignacio; Reyes, Victor: Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (2016)

1 2 next

Further publications can be found at: