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

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

1 2 3 next

  1. Wang, Tong; Lima, Ricardo M.; Giraldi, Loïc; Knio, Omar M.: Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming (2019)
  2. Araya, Ignacio; Neveu, Bertrand: lsmear: a variable selection strategy for interval branch and bound solvers (2018)
  3. Castillo Castillo, Pedro A.; Castro, Pedro M.; Mahalec, Vladimir: Global optimization of MIQCPs with dynamic piecewise relaxations (2018)
  4. Cozad, Alison; Sahinidis, Nikolaos V.: A global MINLP approach to symbolic regression (2018)
  5. Dalkiran, Evrim; Ghalami, Laleh: On linear programming relaxations for solving polynomial programming problems (2018)
  6. D’Ambrosio, Claudia; Furini, Fabio; Monaci, Michele; Traversi, Emiliano: On the product knapsack problem (2018)
  7. Del Pia, Alberto; Khajavirad, Aida: On decomposability of multilinear sets (2018)
  8. Hasan, M. M. Faruque: An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems (2018)
  9. Kannan, Rohit; Barton, Paul I.: Convergence-order analysis of branch-and-bound algorithms for constrained problems (2018)
  10. Khajavirad, Aida; Sahinidis, Nikolaos V.: A hybrid LP/NLP paradigm for global optimization relaxations (2018)
  11. Kılınç, Mustafa R.; Sahinidis, Nikolaos V.: Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON (2018)
  12. Lee, Jon; Skipper, Daphne; Speakman, Emily: Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations (2018)
  13. Lim, Cong Han; Linderoth, Jeff; Luedtke, James: Valid inequalities for separable concave constraints with indicator variables (2018)
  14. Montanher, Tiago; Neumaier, Arnold; Domes, Ferenc: A computational study of global optimization solvers on two trust region subproblems (2018)
  15. Nohra, Carlos J.; Sahinidis, Nikolaos V.: Global optimization of nonconvex problems with convex-transformable intermediates (2018)
  16. Nowak, Ivo; Breitfeld, Norman; Hendrix, Eligius M. T.; Njacheun-Njanzoua, Grégoire: Decomposition-based inner- and outer-refinement algorithms for global optimization (2018)
  17. Schweiger, Jonas: Exploiting structure in non-convex quadratic optimization and gas network planning under uncertainty (2018)
  18. Speakman, Emily; Lee, Jon: On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation (2018)
  19. Vigerske, Stefan; Gleixner, Ambros: SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework (2018)
  20. 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)

1 2 3 next

Further publications can be found at: