Showing math.COShow all
2 papers · 1 filter
math.CO2000
When Does the Positive Semidefiniteness Constraint Help In Lifting Procedures
Levent Tuncel, Michel X. Goemans
We study the lift-and-project procedures of Lovász and Schrijver for 0-1 integer programming problems. We prove that the procedure using the positive semidefiniteness constraint is…
math.CO2000
Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related Problems
Levent Tuncel, Masakazu Kojima
General Successive Convex Relaxation Methods (SRCMs) can be used to compute the convex hull of any compact set, in an Euclidean space, described by a system of quadratic inequaliti…