← All resources

SNOPT

A software package for solving large-scale optimization problems (linear and nonlinear programs). It employs a sparse SQP algorithm with limited-memory quasi-Newton approximations to the Hessian of Lagrangian. SNOPT is especially effective for nonlinear problems whose functions and gradients are expensive to evaluate.

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

LGOSolverLGO is capable of determining high-quality solutions to global optimization problems that have (possibly many) locally optimal solutions. Because LGO makes only limited assumptions as to problem structure and differentiability, it can be applied in a broad range of design and operational applications.
PATHSolverThe PATH solver for MCP models is a Newton-based solver that combines a number of the most effective variations, extensions, and enhancements of this powerful technique.
MOPTA challengeChallengeAnnual challenges from the University of Lehigh
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.
Discord: CVXPYCommunityThe CVXPY Discord community is a group of people who use the CVXPY software to solve convex optimization problems in Python
OSQPSolverThe OSQP (Operator Splitting Quadratic Program) solver is a numerical optimization package for solving convex quadratic programs.