Symmetry in semidefinite programs

@inproceedings{Vallentin2007SymmetryIS,
  title={Symmetry in semidefinite programs},
  author={Frank Vallentin},
  year={2007}
}
This paper is a tutorial in a general and explicit procedure to simplify semidefinite programs which are invariant under the ac tion of a symmetry group. The procedure is based on basic notions of representa tion heory of finite groups. As an example we derive the block diagonalization of the Terwilliger algebra of the binary Hamming scheme in this framework. Here its connection to the orthogonal Hahn and Krawtchouk polynomials becomes v isible. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 16 REFERENCES

L

  • L. Babai
  • Rónyai,Computing irreducible representations of…
  • 1990
Highly Influential
3 Excerpts

Sotirov,Exploiting group symmetry in semidefinite programming rela xations of the quadratic assignment problem

  • R. E. de Klerk
  • 2007
2 Excerpts

code upper bounds from the Terwilliger algebra and semid finite programming

  • A. Schrijver, New
  • IEEE Trans. Inform
  • 2005
3 Excerpts

Symmetry groups

  • K. Gatermann, P. A. Parrilo
  • semidefinite programs, and sums of squares , J…
  • 2004
3 Excerpts

Similar Papers

Loading similar papers…