 | This article has multiple issues. Please help improve it or discuss these issues on the talk page . (Learn how and when to remove these template messages)
|
| Developer(s) | Ruth Misener |
|---|---|
| Stable release | 1.0 |
| Type | Technical computing |
| License | Proprietary |
| Website | www |
ANTIGONE (Algorithms for coNTinuous / Integer Global Optimization of Nonlinear Equations), is a deterministic global optimization solver for general Mixed-Integer Nonlinear Programs (MINLP). [1]
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.
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]
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:
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.
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.
ANTIGONE is part of the GAMS modelling platform.
Using GAMS/ANTIGONE requires an ANTIGONE license, a CPLEX license, and a CONOPT or SNOPT license.
Mathematical optimization or mathematical programming is the selection of a best element, with regard to some criterion, from some set of available alternatives. Optimization problems of sorts arise in all quantitative disciplines from computer science and engineering to operations research and economics, and the development of solution methods has been of interest in mathematics for centuries.
In mathematics, nonlinear programming (NLP) is the process of solving an optimization problem where some of the constraints or the objective function are nonlinear. An optimization problem is one of calculation of the extrema of an objective function over a set of unknown real variables and conditional to the satisfaction of a system of equalities and inequalities, collectively termed constraints. It is the sub-field of mathematical optimization that deals with problems that are not linear.
In mathematics, the relaxation of a (mixed) integer linear program is the problem that arises by removing the integrality constraint of each variable.
The TOMLAB Optimization Environment is a modeling platform for solving applied optimization problems in MATLAB.
In mathematical optimization, a quadratically constrained quadratic program (QCQP) is an optimization problem in which both the objective function and the constraints are quadratic functions. It has the form
BARON is a computational system for solving non-convex optimization problems to global optimality. Purely continuous, purely integer, and mixed-integer nonlinear problems can be solved with the software. BARON is available under the AIMMS, AMPL, and GAMS modeling languages on a variety of platforms. The GAMS/BARON solver is also available on the NEOS Server.
MOSEK is a software package for the solution of linear, mixed-integer linear, quadratic, mixed-integer quadratic, quadratically constraint, conic and convex nonlinear mathematical optimization problems. The applicability of the solver varies widely and is commonly used for solving problems in areas such as engineering, finance and computer science.
The FICO Xpress optimizer is a commercial optimization solver for linear programming (LP), mixed integer linear programming (MILP), convex quadratic programming (QP), convex quadratically constrained quadratic programming (QCQP), second-order cone programming (SOCP) and their mixed integer counterparts. Xpress includes a general purpose non-linear solver, Xpress NonLinear, including a successive linear programming algorithm, and Artelys Knitro.
MINOS is a Fortran software package for solving linear and nonlinear mathematical optimization problems. MINOS may be used for linear programming, quadratic programming, and more general objective functions and constraints, and for finding a feasible point for a set of linear or nonlinear equalities and inequalities.
Convex Over and Under ENvelopes for Nonlinear Estimation (Couenne) is an open-source library for solving global optimization problems, also termed mixed integer nonlinear optimization problems. A global optimization problem requires to minimize a function, called objective function, subject to a set of constraints. Both the objective function and the constraints might be nonlinear and nonconvex. For solving these problems, Couenne uses a reformulation procedure and provides a linear programming approximation of any nonconvex optimization problem.
Deterministic global optimization is a branch of numerical optimization which focuses on finding the global solutions of an optimization problem whilst providing theoretical guarantees that the reported solution is indeed the global one, within some predefined tolerance. The term "deterministic global optimization" typically refers to complete or rigorous optimization methods. Rigorous methods converge to the global optimum in finite time. Deterministic global optimization methods are typically used when locating the global solution is a necessity, when it is extremely difficult to find a feasible solution, or simply when the user desires to locate the best possible solution to a problem.
Artelys Knitro is a commercial software package for solving large scale nonlinear mathematical optimization problems.
αΒΒ is a second-order deterministic global optimization algorithm for finding the optima of general, twice continuously differentiable functions. The algorithm is based around creating a relaxation for nonlinear functions of general form by superposing them with a quadratic of sufficient magnitude, called α, such that the resulting superposition is enough to overcome the worst-case scenario of non-convexity of the original function. Since a quadratic has a diagonal Hessian matrix, this superposition essentially adds a number to all diagonal elements of the original Hessian, such that the resulting Hessian is positive-semidefinite. Thus, the resulting relaxation is a convex function.
Algebraic modeling languages like AIMMS, AMPL, GAMS, MPL and others have been developed to facilitate the description of a problem in mathematical terms and to link the abstract formulation with data-management systems on the one hand and appropriate algorithms for solution on the other. Robust algorithms and modeling language interfaces have been developed for a large variety of mathematical programming problems such as linear programs (LPs), nonlinear programs (NPs), Mixed Integer Programs (MIPs), mixed complementarity programs (MCPs) and others. Researchers are constantly updating the types of problems and algorithms that they wish to use to model in specific domain applications.
The quadratic knapsack problem (QKP), first introduced in 19th century, is an extension of knapsack problem that allows for quadratic terms in the objective function: Given a set of items, each with a weight, a value, and an extra profit that can be earned if two items are selected, determine the number of item to include in a collection without exceeding capacity of the knapsack, so as to maximize the overall profit. Usually, quadratic knapsack problems come with a restriction on the number of copies of each kind of item: either 0, or 1. This special type of QKP forms the 0-1 quadratic knapsack problem, which was first discussed by Gallo et al. The 0-1 quadratic knapsack problem is a variation of knapsack problems, combining the features of unbounded knapsack problem, 0-1 knapsack problem and quadratic knapsack problem.
Ruth Misener is a Professor at the Department of Computing, Imperial College London. Her research concentrates on the development of software and optimisation algorithms for energy efficient engineering and biomedical systems.
Octeract Engine is a proprietary massively parallel deterministic global optimization solver for general Mixed-Integer Nonlinear Programs (MINLP). It uses MPI as a means of accelerating solution times. It is notable for its parallelism and for being the only commercial optimization solver that is free to use.
Christodoulos Achilleus Floudas was a Greek–American chemical engineer.
