Learn More
We consider semidefinite programming problems on which a permutation group is acting. We describe a general technique to reduce the size of such problems, exploiting the symmetry. The technique is based on a low-order matrix *-representation of the commutant (centralizer ring) of the matrix algebra generated by the permutation matrices. We apply it to(More)
We consider the problem of computing the minimum value p min taken by a polynomial p(x) of degree d over the standard simplex ∆. This is an NP-hard problem already for degree d = 2. For any integer k ≥ 1, by minimizing p(x) over the set of rational points in ∆ with denominator k, one obtains a hierarchy of upper bounds p ∆(k) converging to p min as k −→ ∞.(More)
A standard quadratic problem consists of nding global maximizers of a quadratic form over the standard simplex. In this paper, the usual semideenite programming relaxation is strengthened by replacing the cone of positive semideenite matrices by the cone of completely positive matrices (the positive semideenite matrices which allow a factorization F F T(More)
It has been long–conjectured that the crossing number cr(K m,n) of the complete bi-partite graph K m,n equals the Zarankiewicz Number Z(m, n) := ⌊ m−1 2 ⌋⌊ m 2 ⌋⌊ n−1 2 ⌋⌊ n 2 ⌋. Another long–standing conjecture states that the crossing number cr(K n) of the complete graph K n equals Z(n) := 1 4 n 2 n−1 2 n−2 2 n−3 2. In this paper we show the following(More)
We derive a semideenite relaxation of the satissability (SAT) problem and discuss its strength. We give both the primal and dual formulation of the relaxation. The primal formulation is an eigenvalue optimization problem, while the dual formulation is a semideenite feasibility problem. It is shown that using the relaxation, the notorious pigeon hole and(More)
We consider the problem of global minimization of rational functions on IR n (unconstrained case), and on an open, connected, semi-algebraic subset of IR n , or the (partial) closure of such a set (constrained case). We show that in the univariate case (n = 1), these problems have exact reformulations as semidefinite programming (SDP) problems, by using(More)
Initialization in semidefinite programming via a self{dual skew{symmetric embedding. No part of this Journal may be reproduced in any form, by print, photo-print, microolm or any other means without written permission from Faculty ii Abstract The formulation of interior point algorithms for semideenite programming has become an active research area,(More)
Lovász and Schrijver showed how to formulate increasingly tight approximations of the stable set polytope of a graph by solving semidefinite programs (SDP's) of increasing size (lift-and-project method). In this talk we present a similar idea. We show how the stability number can be computed as the solution of a conic linear program (LP) over the cone of(More)