Tools to compute the minimum semidefinite rank of a simple undirected graph
-
Updated
Apr 16, 2024 - Python
Tools to compute the minimum semidefinite rank of a simple undirected graph
Computational appendix of arXiv:2403.02376
Solving quantum comb min-entropy semi-definite programs for measurement-based quantum computing applications
Standard errors for moment matching estimators given limited knowledge about the moment variance-covariance matrix
Representability is a library to work with linearly constrained mathematical programs over tensors.
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.
Polynomial optimization problem solver. Uses relaxation to convert the problem into Semidefinite programming. Can be also used just as Semidefinite programming solver.
MICO: Mutual Information and Conic Optimization for feature selection
Python Tools to Practically Model and Solve the Problem of High Speed Rotor Balancing.
PEPit is a package enabling computer-assisted worst-case analyses of first-order optimization methods.
Add a description, image, and links to the semidefinite-programming topic page so that developers can more easily learn about it.
To associate your repository with the semidefinite-programming topic, visit your repo's landing page and select "manage topics."