There are 6 repositories under semidefinite-programming topic.
Modeling language for Mathematical Optimization (linear, mixed-integer, conic, semidefinite, nonlinear)
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.
[CVPR 2025 Award Candidate & Oral] Convex Relaxation for Robust Vanishing Point Estimation in Manhattan World
Certifiable Outlier-Robust Geometric Perception
Toolbox for gradient-based and derivative-free non-convex constrained optimization with continuous and/or discrete variables.
Semidefinite programming optimization solver
PEPit is a package enabling computer-assisted worst-case analyses of first-order optimization methods.
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.
Python Tools to Practically Model and Solve the Problem of High Speed Rotor Balancing.
Documentation for the Clarabel interior point conic solver
[ECCV 2024] GlobalPointer: Large-Scale Plane Adjustment with Bi-Convex Relaxation
A Julia/JuMP Package for Maximizing Algebraic Connectivity of Undirected Weighted Graphs
Polynomial optimization problem solver. Uses relaxation to convert the problem into Semidefinite programming. Can be also used just as Semidefinite programming solver.
A parallelized, arbitrary precision semidefinite program solver based on the primal-dual interior-point method.
MICO: Mutual Information and Conic Optimization for feature selection
A Julia package for the computation of hard, theoretically guaranteed bounds on the moments of jump-diffusion processes with polynomial data
Irene is a python package that aims to be a toolkit for global optimization problems that can be realized algebraically. It generalizes Lasserre's Relaxation method to handle theoretically any optimization problem with bounded feasibility set. The method is based on solutions of generalized truncated moment problems over commutative real algebras.
SemiDefinite Programming Algorithm (SDPA) for Python
An open-source interface to use the multiple-precision solver SDPA-GMP with YALMIP
An open-source add-on for YALMIP to solve optimisation problems with polynomial quadratic integral inequality constraints.
SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
[WebConf 2020] Searching for polarization in signed graphs: a local spectral approach
Numerical Methods Using Java: For Data Science, Analysis, and Engineering https://www.amazon.com/Numerical-Methods-Using-Java-Engineering/dp/1484267966
Representability is a library to work with linearly constrained mathematical programs over tensors.
Standard errors for moment matching estimators given limited knowledge about the moment variance-covariance matrix