AIMMS - KNITRO Solver Information

KNITRO is a solver for Nonlinear Programming (NLP) problems, including problems with complementarity constraints (MPCC, NCP), equality and inequality constraints (both convex and nonconvex), and bound constraints. Special handling is provided for LPs, QPs, systems of nonlinear equations, and nonlinear least squares problems.

KNITRO provides three (3) different state-of-the-art algorithms to address the wide range of nonlinear optimization applications: 1) a barrier method with direct factorization 2) a barrier method with CG, and 3) an active set method. This equips the user with a range of tools to achieve the best performance for a particular problem. For example, approximate solution points determined by a barrier algorithm can be converged to more accurate solutions by crossing over to the active set algorithm.

All algorithms use exact second order derivatives from AIMMS, and scale efficiently to solve nonlinear problems with tens or even hundreds of thousands of variables and constraints.

Nonlinear programming problems are often nonconvex and in that case there may be many locally optimal solutions. Normally KNITRO returns the first locally optimal solution found but KNITRO offers a multi-start algorithm that searches for a better optimal solution by restarting KNITRO from different initial points.

About KNITRO

KNITRO is developed and supported by Ziena Optimization, Inc, and has been solving commercial optimization applications since 2001. KNITRO is a registered trademark of Ziena Optimization, Inc.
Website: http://www.ziena.com.

Supported Versions

AIMMS supports KNITRO 5.1 and 5.2. Also available in free trial license of AIMMS.

Read on: