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

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

1 2 3 4 next

  1. Bajaj, Ishan; Hasan, M. M. Faruque: Deterministic global derivative-free optimization of black-box problems with bounded Hessian (2020)
  2. Ceccon, Francesco; Siirola, John D.; Misener, Ruth: SUSPECT: MINLP special structure detector for pyomo (2020)
  3. Enayati, Shakiba; Özaltın, Osman Y.: Optimal influenza vaccine distribution with equity (2020)
  4. Fischetti, Matteo; Monaci, Michele: A branch-and-cut algorithm for mixed-integer bilinear programming (2020)
  5. Grimstad, Bjarne; Knudsen, Brage R.: Mathematical programming formulations for piecewise polynomial functions (2020)
  6. Muts, Pavlo; Nowak, Ivo; Hendrix, Eligius M. T.: The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming (2020)
  7. Zhang, Yi; Sahinidis, Nikolaos V.; Nohra, Carlos; Rong, Gang: Optimality-based domain reduction for inequality-constrained NLP and MINLP problems (2020)
  8. Adams, Warren; Gupte, Akshay; Xu, Yibo: Error bounds for monomial convexification in polynomial optimization (2019)
  9. Buchheim, Christoph; Montenegro, Maribel; Wiegele, Angelika: SDP-based branch-and-bound for non-convex quadratic integer optimization (2019)
  10. Cao, Yankai; Zavala, Victor M.: A scalable global optimization algorithm for stochastic nonlinear programs (2019)
  11. Dey, Santanu S.; Santana, Asteroide; Wang, Yang: New SOCP relaxation and branching rule for bipartite bilinear programs (2019)
  12. Furini, Fabio; Traversi, Emiliano; Belotti, Pietro; Frangioni, Antonio; Gleixner, Ambros; Gould, Nick; Liberti, Leo; Lodi, Andrea; Misener, Ruth; Mittelmann, Hans; Sahinidis, Nikolaos V.; Vigerske, Stefan; Wiegele, Angelika: QPLIB: a library of quadratic programming instances (2019)
  13. Hante, Falk M.; Schmidt, Martin: Complementarity-based nonlinear programming techniques for optimal mixing in gas networks (2019)
  14. Houska, Boris; Chachuat, Benoît: Global optimization in Hilbert space (2019)
  15. Khan, Kamil A.: Whitney differentiability of optimal-value functions for bound-constrained convex programming problems (2019)
  16. Li, Can; Grossmann, Ignacio E.: A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables (2019)
  17. Lu, Cheng; Deng, Zhibin; Zhou, Jing; Guo, Xiaoling: A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming (2019)
  18. Najman, Jaromił; Mitsos, Alexander: On tightness and anchoring of McCormick and other relaxations (2019)
  19. Najman, Jaromił; Mitsos, Alexander: Tighter McCormick relaxations through subgradient propagation (2019)
  20. Neveu, Bertrand; de la Gorce, Martin; Monasse, Pascal; Trombettoni, Gilles: A generic interval branch and bound algorithm for parameter estimation (2019)

1 2 3 4 next


Further publications can be found at: http://helios.princeton.edu/ANTIGONE/publications.html