This paper is a tutorial in a general and explicit procedure to simplify semidefinite programming problems which are invariant under the action of a group. The procedure is based on basic notions of representation theory of finite groups. As an example we derive the block diagonalization of the Terwilliger algebra in this framework. Here its connection to the orthogonal Hahn and Krawtchouk polynomials becomes visible.
, , ,
,
Cornell University Library
arXiv.org e-Print archive
Semidefinite programming and combinatorial optimization , Spinoza prijs Lex Schrijver
Networks and Optimization

Vallentin, F. (2007). Symmetry in semidefinite programs. arXiv.org e-Print archive. Cornell University Library.