← All resources

KNITRO

The most advanced solver for nonlinear optimization.

Type: Solver
Topic: Nonlinear and convex optimization
Audience: Practitioner
Researcher

More from Artelys

KalisSolverAn innovative constraints programming component able to solve quickly and efficiently a wide range of combinatorial problems relying on an interactive and user-friendly hybrid framework including constraint programming, mixed-integer programming and artificial intelligence.

OSQPSolverThe OSQP (Operator Splitting Quadratic Program) solver is a numerical optimization package for solving convex quadratic programs.
SCSSolverSCS (Splitting Conic Solver) is a numerical optimization package for solving large-scale convex quadratic cone problems. The code is freely available on https://github.com/cvxgrp/scs. It solves primal-dual problems.
CVXPYModeling languageCVXPY is an open source Python-embedded modeling language for convex optimization problems. It lets you express your problem in a natural way that follows the math, rather than in the restrictive standard form required by solvers.
MOPTA challengeChallengeAnnual challenges from the University of Lehigh
Discord: CVXPYCommunityThe CVXPY Discord community is a group of people who use the CVXPY software to solve convex optimization problems in Python
MosekSolverSolves your LPs, QPs, SOCPs, SDPs, and MIPs. Includes interfaces to C, C++, Java, MATLAB, .NET, Python, Julia, Rust and R.