Symmetry in semidefinite programs

dc.creatorVallentin, Frank
dc.date2007-06-28
dc.date2008-07-30
dc.date.accessioned2026-07-07T10:12:33Z
dc.date.available2026-07-07T10:12:33Z
dc.descriptionThis paper is a tutorial in a general and explicit procedure to simplify semidefinite programs which are invariant under the action of a symmetry 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 of the binary Hamming scheme in this framework. Here its connection to the orthogonal Hahn and Krawtchouk polynomials becomes visible.
dc.description10 pages (v3) minor changes, to appear in Linear Algebra and Its Applications
dc.identifierhttps://arxiv.org/abs/0706.4233
dc.identifierhttp://arxiv.org/abs/0706.4233
dc.identifierLinear Algebra and Appl. 430 (2009), 360-369
dc.identifierdoi:10.1016/j.laa.2008.07.025
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/172216
dc.subjectOptimization and Control
dc.subjectCombinatorics
dc.subject90C22, 33C90
dc.titleSymmetry in semidefinite programs
dc.typetext

Files

Collections