Symmetry in semidefinite programs

Frank Vallentin(f.vallentincwi.nl)

Abstract: 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.

Keywords: semidefinite programming, block diagonalization, orthogonal polynomials, Terwilliger algebra

Category 1: Linear, Cone and Semidefinite Programming (Semi-definite Programming )

Citation:

Download: [Postscript][PDF]

Entry Submitted: 06/28/2007
Entry Accepted: 06/28/2007
Entry Last Modified: 06/28/2007

Modify/Update this entry