Artelys Knitro

Artelys Knitro
Designed by	Richard Waltz Jorge Nocedal Todd Plantenga Richard Byrd
Developer	Artelys
First appeared	2001 (2001)

Stable release	10.0.0 / October 31, 2015 (2015-10-31)
OS	Cross-platform
License	Proprietary
Website	www.artelys.com/en/optimization-tools/knitro

Artelys Knitro is a commercial software package for solving large scale mathematical optimization problems. Knitro is specialized for nonlinear optimization, but also solves linear programming problems, quadratic programming problems, systems of nonlinear equations, and problems with equilibrium constraints (complementarities). The unknowns in these problems must be continuous variables in continuous functions; however, functions can be convex or nonconvex. Knitro computes a numerical solution to the problem—it does not find a symbolic mathematical solution.

Knitro can also solve mixed integer linear, quadratic or nonlinear programming problems, i.e. problems with variables that take integer values.

Optimization problems must be presented to Knitro in mathematical form, and should provide a way of computing function derivatives using sparse matrices. Problems may be written in C, C++, C#, Fortran, Java, or Python, in which case Knitro is called as a software routine to solve the problem. An often easier approach is to develop the optimization problem in an algebraic modeling language (AML) like AIMMS, AMPL, GAMS, Mathematica, MATLAB, Mosel (through the Xpress-NonLinear module), etc. The modeling environment computes function derivatives, and Knitro is called as a "solver" from within the environment.

Knitro offers four different optimization algorithms for solving optimization problems. Two algorithms are of the interior point type, and two are of the active set type. These algorithms are known to have fundamentally different characteristics; for example, interior point methods follow a path through the interior of the feasible region while active set methods tend to stay at the boundaries. Knitro provides both types of algorithm for greater flexibility in solving problems, and allows crossover during the solution process from one algorithm to another. The code also provides a multistart option for promoting the computation of the global minimum.

KNITRO (original solver name), short for "Nonlinear Interior point Trust Region Optimization" (the "K" is silent) was created primarily by Richard Waltz, Jorge Nocedal, Todd Plantenga and Richard Byrd. It is produced by Artelys. KNITRO was introduced in 2001 as a derivative of academic research at Northwestern University (through Ziena Optimization LLC), and has undergone continual improvement since.

References

Nocedal, Jorge; Wright, Stephen J. (2006). Numerical Optimization, 2nd Edition. Springer. ISBN 0-387-30303-0.
R.H. Byrd; J. Nocedal; R.A. Waltz (2006). "KNITRO: An Integrated Package for Nonlinear Optimization" (PDF).

External links

Artelys (developer of Artelys Knitro)
Jorge Nocedal (home page at Northwestern University)
Online documentation

Mathematical optimization software

Data formats	LP MPS nl OptML OSiL sol xMPS

Modeling tools	AIMMS AMPL APMonitor CMPL CVX CVXOPT CVXPY ECLiPSe-CLP GAMS GNU MathProg JuMP LINDO OPL MPL OptimJ PICOS PuLP Pyomo ROML TOMLAB Xpress-Mosel YALMIP ZIMPL

LP, MILP^∗ solvers	ABACUS^∗ APOPT^∗ Artelys Knitro^∗ BCP^∗ BDMLP BPMPD BPOPT CLP CBC^∗ CPLEX^∗ CSDP DSDP FortMP^∗ GCG^∗ GIPALS32 GLPK/GLPSOL^∗ Gurobi^∗ HOPDM LINDO^∗ lp_solve^∗ LOQO MINOS MINTO^∗ MOSEK^∗ OOPS OOQP PCx QSopt SAS/OR^∗ SCIP^∗ SoPlex SOPT-IP^∗ Sulum Optimization Tools^∗ SYMPHONY^∗ XA^∗ Xpress-Optimizer^∗

QP, MIQP^∗ solvers	APOPT^∗ Artelys Knitro^∗ BPMPD BPOPT BQPD CBC^∗ CLP CPLEX^∗ FortMP^∗ GloMIQO^∗ Gurobi^∗ IPOPT LINDO^∗ LSSOL LOQO MINOS MOSEK^∗ OOPS OOQP QPOPT QPSOL SCIP^∗ XA Quadratic Solver Xpress-Optimizer^∗

QCP, MIQCP^∗ solvers	APOPT^∗ Artelys Knitro^∗ BPMPD BPOPT CPLEX^∗ GloMIQO^∗ Gurobi^∗ IPOPT LINDO^∗ LOQO MINOS MOSEK^∗ SCIP^∗ Xpress-Optimizer^∗ Xpress-SLP^∗

SOCP, MISOCP^∗ solvers	CPLEX^∗ DSDP Gurobi^∗ LINDO^∗ LOQO MOSEK^∗ SCIP^∗ SDPT3 SeDuMi Xpress-Optimizer^∗

SDP, MISDP^∗ solvers	CSDP DSDP MOSEK PENBMI PENSDP SCIP-SDP^∗ SDPA SDPT3 SeDuMi

NLP, MINLP^∗ solvers	ALGENCAN AlphaECP^∗ ANTIGONE^∗ AOA^∗ APOPT^∗ Artelys Knitro^∗ BARON^∗ Bonmin^∗ BPOPT CONOPT Couenne^∗ DICOPT^∗ FilMINT^∗ FilterSQP Galahad library ipfilter IPOPT LANCELOT LINDO^∗ LOQO LRAMBO MIDACO^∗ MILANO^∗ MINLP BB^∗ MINOS Minotaur^∗ MISQP^∗ NLPQLP NPSOL OQNLP^∗ PATHNLP PENNON SBB^∗ SCIP^∗ SNOPT^∗ SQPlab WORHP Xpress-SLP^∗

GO solvers	BARON Couenne^∗ LINDO SCIP

CP solvers	Artelys Kalis Choco Comet CPLEX CP Optimizer Gecode Google CP Solver JaCoP OscaR

Metaheuristic solvers	OptaPlanner LocalSolver

List of optimization software Comparison of optimization software

This article is issued from Wikipedia - version of the 9/28/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.