Abstract: This 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.
Recommendations
- Handling symmetries in mixed-integer semidefinite programs
- scientific article; zbMATH DE number 5992123
- Symmetry in mathematical programming
- Symmetry in integer linear programming
- Exploiting symmetry in copositive programs via semidefinite hierarchies
- Symmetry groups, semidefinite programs, and sums of squares
- Symmetries of the positive semidefinite cone
- Symmetry in the duality theory for vector optimization problems
- Symmetry definitions for constraint satisfaction problems
Cites work
- Computing Irreducible Representations of Finite Groups
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- Exploiting group symmetry in truss topology optimization
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Fastest Mixing Markov Chain on a Graph
- Group symmetry in interior-point methods for semidefinite program
- scientific article; zbMATH DE number 1601795 (Why is no real title available?)
- scientific article; zbMATH DE number 3170494 (Why is no real title available?)
- scientific article; zbMATH DE number 49937 (Why is no real title available?)
- scientific article; zbMATH DE number 3510705 (Why is no real title available?)
- scientific article; zbMATH DE number 3625993 (Why is no real title available?)
- scientific article; zbMATH DE number 1160038 (Why is no real title available?)
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- New upper bounds for kissing numbers from semidefinite programming
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
- Reduction of symmetric semidefinite programs using the regular -representation
- Strengthened semidefinite programming bounds for codes
- Symmetry groups, semidefinite programs, and sums of squares
Cited in
(41)- Commutative association schemes
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- Group symmetry in interior-point methods for semidefinite program
- Symmetry groups, semidefinite programs, and sums of squares
- Group symmetry and covariance regularization
- Semidefinite programs and association schemes
- Decomposed structured subsets for semidefinite and sum-of-squares optimization
- Q-polynomial coherent configurations
- Certifying the global optimality of quartic minimization over the sphere
- Dimension reduction for semidefinite programs via Jordan algebras
- Exploiting symmetry in copositive programs via semidefinite hierarchies
- Simultaneous singular value decomposition
- Semidefinite programming for permutation codes
- On symmetry groups of some quadratic programming problems
- Introduction to semidefinite, conic and polynomial optimization
- Invariant Semidefinite Programs
- Symmetry in mathematical programming
- Symmetry and Satisfiability: An Update
- RepLAB: a computational/numerical approach to representation theory
- Tight relative \(t\)-designs on two shells in hypercubes, and Hahn and Hermite polynomials
- Symmetry reduction in AM/GM-based optimization
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- New Bounds for Spherical Two-Distance Sets
- DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
- Symmetry reduction to optimize a graph-based polynomial from queueing theory
- Automorphisms of Rank-One Generated Hyperbolicity Cones and Their Derivative Relaxations
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
- Reflection groups and cones of sums of squares
- Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming
- Primal-dual interior-point algorithm for symmetric model predictive control
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
- Euclidean designs obtained from spherical embedding of coherent configurations
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
- Symmetric chains, Gelfand--Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme
- On symmetry adapted bases in trigonometric optimization
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- Sparse sub-Gaussian random projections for semidefinite programming relaxations
- Symmetries in polynomial optimization
- Two results on the convex algebraic geometry of sets with continuous symmetries
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
- Reduction of symmetric semidefinite programs using the regular -representation
This page was built for publication: Symmetry in semidefinite programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q958029)
