Reduction of symmetric semidefinite programs using the regular representation
We consider semidefinite programming problems on which a permutation group is acting.We describe a general technique to reduce the size of such problems, exploiting the symmetry. The technique is based on a low-order matrix ∗-representation of the commutant (centralizer ring) of the matrix algebra g...
Saved in:
Main Authors: | Klerk, Etienne de., Pasechnik, Dmitrii V., Schrijver, Alexander. |
---|---|
其他作者: | School of Physical and Mathematical Sciences |
格式: | Article |
語言: | English |
出版: |
2012
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/94065 http://hdl.handle.net/10220/7625 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
相似書籍
-
On semidefinite programming relaxations of the traveling salesman problem
由: De Klerk, Etienne., et al.
出版: (2009) -
Numerical block diagonalization of matrix - algebras with application to semidefinite programming
由: Klerk, Etienne de., et al.
出版: (2012) -
On semidefinite programming relaxations of maximum k -section
由: Klerk, Etienne de., et al.
出版: (2013) -
Approximation of the stability number of a graph via copositive programming
由: Klerk, Etienne de., et al.
出版: (2011) -
A linear programming reformulation of the standard quadratic optimization problem
由: Klerk, Etienne de., et al.
出版: (2013)