Latest documents http://publikationen.stub.uni-frankfurt.de/index/index/ Sun, 08 May 2011 12:07:50 +0200 Sun, 08 May 2011 12:07:50 +0200 http://publikationen.stub.uni-frankfurt.de/frontdoor/index/index/docId/22352 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. Cordian Riener doctoralthesis http://publikationen.stub.uni-frankfurt.de/frontdoor/index/index/docId/22352 Fri, 05 Aug 2011 12:07:50 +0200