Reduction of symmetric semidefinite programs using the regular *-representation

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 extending a method of de Klerk et al. that gives a semidefinite programming lower bound to the crossing number of complete bipartite graphs.

Citation

Preprint, February, 2005.

Article

Download

View Reduction of symmetric semidefinite programs using the regular *-representation