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

Splitting Conic Solver

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

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

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

|toqito> (Theory of Quantum Information Toolkit) is a Python library for research in quantum information theory.

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

Certifiable Outlier-Robust Geometric Perception

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

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

[CVPR 2025 Award Candidate & Oral] Convex Relaxation for Robust Vanishing Point Estimation in Manhattan World

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.

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

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

Documentation for the Clarabel interior point conic solver