activity
19992026
most citedA search for quantum coin-flipping protocols using optimization techniques

16 citations · 42 across the 27 of their papers we have counts for

collaborators

31 papers

math.OC2026

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach

Nathan Benedetto Proença, Marcel K. de Carli Silva, Cristiane M. Sato +1

We present experimental work on a primal-dual framework simultaneously approximating maximum cut and weighted fractional cut-covering instances. In this primal-dual framework, we s…

math.OC2023

Stable Set Polytopes with High Lift-and-Project Ranks for the Lovász-Schrijver SDP Operator

Yu Hin Au, Levent Tunçel

We study the lift-and-project rank of the stable set polytopes of graphs with respect to the Lovász-Schrijver SDP operator . In particular, we focus on a search for re…

math.OC2022

Linear optimization over homogeneous matrix cones

Levent Tunçel, Lieven Vandenberghe

A convex cone is homogeneous if its automorphism group acts transitively on the interior of the cone, i.e., for every pair of points in the interior of the cone, there exists a con…

math.CO2022

Testing idealness in the filter oracle model

Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin +1

A filter oracle for a clutter consists of a finite set along with an oracle which, given any set , decides in unit time whether or not contains a member of th…

math.CO2021

Total dual dyadicness and dyadic generating sets

Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin +1

A vector is \emph{dyadic} if each of its entries is a dyadic rational number, i.e. of the form for some integers with . A linear system wi…

math.OC2019

Domain-Driven Solver (DDS) Version 2.0: a MATLAB-based Software Package for Convex Optimization Problems in Domain-Driven Form

Mehdi Karimi, Levent Tunçel

Domain-Driven Solver (DDS) is a MATLAB-based software package for convex optimization problems in Domain-Driven form [Karimi and Tunçel, arXiv:1804.06925]. The current version of D…