2 citations · 3 across the 6 of their papers we have counts for
Showing math.OCShow all
3 papers · 1 filter
math.OC2025
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…
math.OC2018★ 2 cited
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…
math.OC2018
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…