1 citations · 1 across the 10 of their papers we have counts for
4 papers · 1 filter
Efficient Implementation of Interior-Point Methods for Quantum Relative Entropy
Mehdi Karimi, Levent Tuncel
Quantum Relative Entropy (QRE) programming is a recently popular and challenging class of convex optimization problems with significant applications in quantum computing and quantu…
Everything is possible: constructing spectrahedra with prescribed facial dimensions
Vera Roshchina, Levent Tunçel
Given any finite set of nonnegative integers, there exists a closed convex set whose facial dimension signature coincides with this set of integers, that is, the dimensions of its…
A Primal-Dual Extension of the Goemans--Williamson Algorithm for the Weighted Fractional Cut-Covering Problem
Nathan Benedetto Proença, Marcel K. de Carli Silva, Cristiane M. Sato +1
We study a weighted generalization of the fractional cut-covering problem, which we relate to the maximum cut problem via antiblocker and gauge duality. This relationship allows us…
Dyadic linear programming and extensions
Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin +1
A rational number is dyadic if it has a finite binary representation , where is an integer and is a nonnegative integer. Dyadic rationals are important for numerical…