Modeling language for Mathematical Optimization (linear, mixed-integer, conic, semidefinite, nonlinear)

Splitting Conic Solver

An implementation of the SE-Sync algorithm for synchronization over the special Euclidean group.

Clarabel.rs: Interior-point solver for convex conic optimisation problems in Rust.

COSMO: Accelerated ADMM-based solver for convex conic optimisation problems (LP, QP, SOCP, SDP, ExpCP, PowCP). Automatic chordal decomposition of sparse semidefinite programs.

Clarabel.jl: Interior-point solver for convex conic optimisation problems in Julia.

Toolbox for gradient-based and derivative-free non-convex constrained optimization with continuous and/or discrete variables.

Certifiable Outlier-Robust Geometric Perception

Bayesian Optimization of Combinatorial Structures

Semidefinite programming optimization solver

PEPit is a package enabling computer-assisted worst-case analyses of first-order optimization methods.

Solver for Large-Scale Rank-One Semidefinite Relaxations

LipSDP - Lipschitz Estimation for Neural Networks

Code of the Performance Estimation Toolbox (PESTO) whose aim is to ease the access to the PEP methodology for performing worst-case analyses of first-order methods in convex and nonconvex optimization. The numerical worst-case analyses from PEP can be performed just by writting the algorithms just as you would implement them.

Clarabel.cpp: C/C++ interface to the Clarabel Interior-point solver for convex conic optimisation problems.

A Julia/JuMP Package for Maximizing Algebraic Connectivity of Undirected Weighted Graphs

[ECCV 2024] GlobalPointer: Large-Scale Plane Adjustment with Bi-Convex Relaxation

Python Tools to Practically Model and Solve the Problem of High Speed Rotor Balancing.

Polynomial optimization problem solver. Uses relaxation to convert the problem into Semidefinite programming. Can be also used just as Semidefinite programming solver.

Documentation for the Clarabel interior point conic solver