ANTIGONE

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 23 articles )

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

1 2 next

  1. Andrea Callia D’Iddio, Michael Huth: Manyopt: An Extensible Tool for Mixed, Non-Linear Optimization Through SMT Solving (2017) arXiv
  2. 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)
  3. Boukouvala, Fani; Floudas, Christodoulos A.: ARGONAUT: algorithms for global optimization of constrained grey-box computational problems (2017)
  4. Buchheim, Christoph; D’Ambrosio, Claudia: Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization (2017)
  5. Gerard, D.; Köppe, M.; Louveaux, Q.: Guided dive for the spatial branch-and-bound (2017)
  6. Gleixner, Ambros M.; Berthold, Timo; Müller, Benjamin; Weltge, Stefan: Three enhancements for optimization-based bound tightening (2017)
  7. Harwood, Stuart M.; Barton, Paul I.: How to solve a design centering problem (2017)
  8. Kallrath, Josef: Packing ellipsoids into volume-minimizing rectangular boxes (2017)
  9. Khan, Kamil A.; Watson, Harry A.J.; Barton, Paul I.: Differentiable McCormick relaxations (2017)
  10. Lima, Ricardo M.; Grossmann, Ignacio E.: On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (2017)
  11. Puranik, Yash; Sahinidis, Nikolaos V.: Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (2017)
  12. Speakman, Emily; Yu, Han; Lee, Jon: Experimental validation of volume-based comparison for double-McCormick relaxations (2017)
  13. Araya, Ignacio; Reyes, Victor: Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (2016)
  14. Castro, Pedro M.: Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems (2016)
  15. Domes, Ferenc; Neumaier, Arnold: Linear and parabolic relaxations for quadratic constraints (2016)
  16. Kronqvist, Jan; Lundell, Andreas; Westerlund, Tapio: The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming (2016)
  17. Lim, Cong Han; Linderoth, Jeff; Luedtke, James: Valid inequalities for separable concave constraints with indicator variables (2016)
  18. Neveu, Bertrand; Trombettoni, Gilles; Araya, Ignacio: Node selection strategies in interval branch and bound algorithms (2016)
  19. Rebennack, Steffen: Computing tight bounds via piecewise linear functions through the example of circle cutting problems (2016)
  20. Zhang, Yan; Sahinidis, Nikolaos V.: Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment (2016)

1 2 next