2 citations · 3 across the 6 of their papers we have counts for
6 papers
New complexity bounds for primal--dual interior-point algorithms in conic optimization
Joachim Dahl, Levent Tunçel, Lieven Vandenberghe
We provide improved complexity results for symmetric primal--dual interior-point algorithms in conic optimization. The results follow from new uniform bounds on a key complexity me…
Generalizations of Total Dual Integrality
Bertrand Guenin, Levent Tunçel
We design new tools to study variants of Total Dual Integrality. As an application, we obtain a geometric characterization of Total Dual Integrality for the case where the associat…
Stable Set Polytopes with Rank for the Lovász--Schrijver SDP Operator
Yu Hin Au, Levent Tunçel
We study the lift-and-project rank of the stable set polytope of graphs with respect to the Lovász--Schrijver SDP operator applied to the fractional stable set polyto…
Graphs with large girth and chromatic number are hard for Nullstellensatz
Julian Romero, Levent Tunçel
We study the computational efficiency of approaches, based on Hilbert's Nullstellensatz, which use systems of linear equations for detecting non-colorability of graphs having large…
Strict Complementarity in MaxCut SDP
Marcel K. de Carli Silva, Levent Tunçel
The MaxCut SDP is one of the most well-known semidefinite programs, and it has many favorable properties. One of its nicest geometric/duality properties is the fact that the vertic…
Pointed Closed Convex Sets are the Intersection of All Rational Supporting Closed Halfspaces
Marcel K. de Carli Silva, Levent Tunçel
We prove that every pointed closed convex set in is the intersection of all the rational closed halfspaces that contain it. This generalizes a previous result by the…