05E05 Symmetric functions and generalizations
- Symmetries in semidefinite and polynomial optimization : relaxations, combinatorics, and the degree principle / von Cordian Benedikt Riener (2011)
- In recent years using symmetry has proven to be a very useful tool to simplify computations in semidefinite programming. This dissertation examines the possibilities of exploiting discrete symmetries in three contexts: In SDP-based relaxations for polynomial optimization, in testing positivity of symmetric polynomials, and combinatorial optimization. In these contexts the thesis provides new ways for exploiting symmetries and thus deeper insight in the paradigms behind the techniques and studies a concrete combinatorial optimization question.