Posts tagged: Semidefinite programming

Relaxations of parametric and bilevel polynomial optimization problems

Semidefinite programming relaxations of polynomial optimization problems of commuting variables with moment constraints, parametric and bilevel variants.

Posted on . Tags: Noncommutative polynomials, Python, Semidefinite programming

Semidefinite programming in Python

A brief overview of SDP solvers and tools in Python

Posted on . Tags: Semidefinite programming, Python

Optimal randomness generation from entangled quantum states

Optimal randomness generation from entangled quantum states: computational appendix to arXiv:1505.03837.

Posted on . Tags: Noncommutative polynomials, Python, Quantum information theory, Semidefinite programming

Detecting a rank loop in the NPA hierarchy

It is possible to detect a rank loop in the hierarchy of SDP relaxations of polynomial optimization problems, but an arbitrary-precision SDP solver is recommended.

Posted on . Tags: Noncommutative polynomials, Semidefinite programming, Quantum information theory, Python

SDPA with different compilers and linear algebra libraries

GCC, ICC, PGI compilers with BLAS/LAPACK, MKL, and ACML are compared in solving an SDP with SDPA.

Posted on . Tags: Semidefinite programming, C++

Second-order semidefinite relaxation of a commutative polynomial optimization problem

Second-order semidefinite relaxation of a constrained commutative polynomial optimization problem using PICOS in Python, exporting to SDPA.

Posted on . Tags: Semidefinite programming, Python