ANTIGONE

ANTIGONEDeveloper(s)| Ruth Misener

|

Stable release|

1.0

Type| Technical computing
License| Proprietary
Website| www.gams.com/latest/docs/S_ANTIGONE.html

ANTIGONE (Algorithms for coNTinuous / Integer Global Optimization of Nonlinear Equations), is a deterministic global optimization solver for general Mixed-Integer Nonlinear Programs (MINLP).[1]

## Contents

* 1 History
* 2 Features
* 3 Limitations
* 4 Interfaces
* 5 Licensing
* 6 See also
* 7 References

## History

ANTIGONE is an evolution of GloMIQO,[2] a global Mixed-Integer Quadratic Programming solver written by Ruth Misener. ANTIGONE extends the functionality of GloMIQO to general MINLP problems.

## Features

Like all deterministic global optimization software, ANTIGONE is a toolbox of many techniques in order to tackle different special cases of nonlinear structure. That being said, it is predominantly a branch-and-bound solver. Its main algorithmic procedure is split into 4 main steps:[3]

1. Reformulation of user input
2. Detection of special structure
3. Selection of best algorithm for the detected structure
4. Solution of the problem using the selected algorithm

With the exception of special cases of optimization problems (for instance convex NLPs) which can be solved at the root node of the branch-and-bound algorithm, ANTIGONE will initiate a branch and bound procedure. This procedure involves the following steps:

* Generating/updating convex relaxations (lower bounding problems)
* Domain reduction
* Search for feasible solutions (upper bounds)
* Calculation of rigorous lower bounds by solving the convex lower bounding problems.

ANTIGONE employs classic factorable programming techniques to generate relaxations, e.g., McCormick Relaxations, as well as contemporary algorithms, such as the Reformulation-Linearisation Technique (RLT), Edge Convex/Concave relaxations, and Alpha BB cuts. ANTIGONE also possesses a dynamic cut generator, which generates and handles locally and globally valid cuts.

## Limitations

Like all deterministic global optimization software, ANTIGONE requires the user to provide the explicit mathematical expressions for all the functions used in the problem, as well as initial bounds for all variables. If initial bounds are not supplied, ANTIGONE will attempt to infer bounds, but global optimality is not guaranteed. ANTIGONE can only solve differentiable functions, and can not solve trigonometric problems.

## Interfaces

ANTIGONE is part of the GAMS modelling platform.

## Licensing

Using GAMS/ANTIGONE requires an ANTIGONE license, a CPLEX license, and a CONOPT or SNOPT license.

## See also

* BARON
* Couenne

## References

1. ↑ Misener, Ruth; Floudas, Christodoulos A. (2014). "ANTIGONE: Algorithms for coNTinuous / Integer Global Optimization of Nonlinear Equations". Journal of Global Optimization 59 (2–3): 503–526. doi:10.1007/s10898-014-0166-2.
2. ↑ Misener, Ruth; Floudas, Christodoulos A. (2013). "GloMIQO: Global mixed-integer quadratic optimizer". Journal of Global Optimization 57: 3–50. doi:10.1007/s10898-012-9874-7.
3. ↑ ANTIGONE documentation in GAMS, 16 Apr 2013, https://www.gams.com/latest/docs/S_ANTIGONE.html, retrieved 27 July 2019

* v
* t
* e

Mathematical optimization software

Data formats|

* Mathematica
* MPS
* nl
* sol

Modeling tools|

* AIMMS
* AMPL
* APMonitor
* ECLiPSe-CLP
* GEKKO
* GAMS
* GNU MathProg
* JuMP
* LINDO
* OPL
* Mathematica
* OptimJ
* PuLP
* Pyomo
* TOMLAB
* Xpress-Mosel
* ZIMPL

LP, MILP∗ solvers|

* APOPT∗
* Artelys Knitro∗
* BCP∗
* CLP
* CBC∗
* CPLEX∗
* FortMP∗
* GCG∗
* GLPK/GLPSOL∗
* Gurobi∗
* LINDO∗
* Lp_solve
* LOQO
* Mathematica
* MINOS
* MINTO∗
* MOSEK∗
* SCIP∗
* SoPlex
* SYMPHONY∗
* Xpress-Optimizer∗

QP, MIQP∗ solvers|

* APOPT∗
* Artelys Knitro∗
* CBC∗
* CLP
* CPLEX∗
* FortMP∗
* Gurobi∗
* IPOPT
* LINDO∗
* Mathematica
* MINOS
* MOSEK∗
* SCIP∗
* Xpress-Optimizer∗

QCP, MIQCP∗ solvers|

* APOPT∗
* Artelys Knitro∗
* CPLEX∗
* Gurobi∗
* IPOPT
* LINDO∗
* Mathematica
* MINOS
* MOSEK∗
* SCIP∗
* Xpress-Optimizer∗
* Xpress-SLP∗

SOCP, MISOCP∗ solvers|

* Artelys Knitro∗
* CPLEX∗
* Gurobi∗
* LINDO∗
* LOQO
* Mathematica
* MOSEK∗
* SCIP∗
* Xpress-Optimizer∗

SDP, MISDP∗ solvers|

* Mathematica
* MOSEK

NLP, MINLP∗ solvers|

* AOA∗
* APOPT∗
* Artelys Knitro∗
* BARON∗
* Couenne∗
* Galahad library
* IPOPT
* LINDO∗
* LOQO
* MIDACO∗
* MINOS
* NLPQLP
* NPSOL
* SCIP∗
* SNOPT∗
* WORHP
* Xpress-SLP∗

GO solvers|

* BARON
* Couenne∗
* Mathematica
* LINDO
* SCIP

CP solvers|

* Comet
* CPLEX CP Optimizer
* Gecode
* Mathematica
* JaCoP

Metaheuristic solvers|

* OptaPlanner

* List of optimization software
* Comparison of optimization software

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/ANTIGONE. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Software:ANTIGONE&oldid=450137"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template