5 papers · 1 filter
Beyond binarity: Semidefinite programming for ternary quadratic problems
Frank de Meijer, Veronica Piccialli, Renata Sotirov +1
We study the ternary quadratic problem (TQP), a quadratic optimization problem with linear constraints where the variables take values in . While semidefinite program…
Lagrangian Duality for Mixed-Integer Semidefinite Programming: Theory and Algorithms
Frank de Meijer, Renata Sotirov
This paper presents the Lagrangian duality theory for mixed-integer semidefinite programming (MISDP). We derive the Lagrangian dual problem and prove that the resulting Lagrangian…
Exploiting Symmetries in Optimal Quantum Circuit Design
Frank de Meijer, Dion Gijswijt, Renata Sotirov
A physical limitation in quantum circuit design is the fact that gates in a quantum system can only act on qubits that are physically adjacent in the architecture. To overcome this…
On Integrality in Semidefinite Programming for Discrete Optimization
Frank de Meijer, Renata Sotirov
It is well-known that by adding integrality constraints to the semidefinite programming (SDP) relaxation of the max-cut problem, the resulting integer semidefinite program is an ex…
SDP-based bounds for the Quadratic Cycle Cover Problem via cutting plane augmented Lagrangian methods and reinforcement learning
Frank de Meijer, Renata Sotirov
We study the Quadratic Cycle Cover Problem (QCCP), which aims to find a node-disjoint cycle cover in a directed graph with minimum interaction cost between successive arcs. We deri…