Optimization Online


Invariant semidefinite programs

Christine Bachoc (bachoc***at***math.u-bordeaux1.fr)
Dion C. Gijswijt (dion.gijswijt***at***gmail.com)
Alexander Schrijver (lex***at***cwi.nl)
Frank Vallentin (f.vallentin***at***tudelft.nl)

Abstract: In the last years many results in the area of semidefinite programming were obtained for invariant (finite dimensional, or infinite dimensional) semidefinite programs - SDPs which have symmetry. This was done for a variety of problems and applications. The purpose of this handbook chapter is to give the reader the necessary background for dealing with semidefinite programs which have symmetry. Here the basic theory is given and it is illustrated in applications from coding theory, combinatorics, geometry, and polynomial optimization.


Category 1: Linear, Cone and Semidefinite Programming

Citation: this article was written for the "Handbook of Semidefinite, Cone and Polynomial Optimization: Theory, Algorithms, Software and Applications"

Download: [PDF]

Entry Submitted: 07/17/2010
Entry Accepted: 07/17/2010
Entry Last Modified: 11/22/2010

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society