ANTIGONE: Algorithms for coNTinuous / Integer Global Optimization of Nonlinear Equations

By Ruth Misener, Christodoulos A. Floudas. Journal of Global Optimization, 2014

563 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Control and Systems Engineering, Numerical Analysis

View Paper: https://www.semanticscholar.org/paper/efc3bad7eb51436e1011867ecd5084d60bd690a5

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Jaehyun Park
2. Ignacio E. Grossmann
3. Stephen P. Boyd
4. Qie He
5. Yongjia Song
6. Jan Kronqvist
7. David E. Bernal
8. Ricardo Fukasawa

In Control and Systems Engineering

1. Jan Kronqvist
2. David E. Bernal
3. Andreas Lundell
4. Jaehyun Park
5. Ignacio E. Grossmann
6. Stephen P. Boyd
7. Qie He
8. Yongjia Song

In Numerical Analysis

1. Jaehyun Park
2. Jan Kronqvist
3. David E. Bernal
4. Andreas Lundell
5. Ignacio E. Grossmann
6. Stephen P. Boyd
7. Qie He
8. Yongjia Song

Citations in the corpus

• A disjunctive convex programming approach to the pollution-routing problem (2016, methodology): “It can be solved by MICP solvers such as Bonmin [15], DICOPT [32], and FilMINT [1], or solved as a mixed integer nonlinear program (MINLP) by global optimization solvers such as Antigone [50], Baron [56], MINOTAUR [47], and SCIP [2].”
• A review and comparison of solvers for convex MINLP (2018, methodology): “ANTIGONE uses local solvers for finding feasible solutions and uses MILP relaxations to obtain valid lower bounds, resulting in a sequence of relaxations converging to the global optimum [102].”
• General Heuristics for Nonconvex Quadratically Constrained Quadratic Programming (2017, background): “QCQPs. Gurobi [GO15], CPLEX [IBM13], MOSEK [ApS17], and SCIP [Ach09]provide globalmethods formixed-integer nonlinearprograms, with limited support for nonconvex constraints. Packages such as ANTIGONE [MF14a], KNITRO [BNW06], and NLopt [Joh14] provide global and local optimization methods for nonline”