Symmetry in semidefinite programs
From MaRDI portal
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
- 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?)
- Computing Irreducible Representations of Finite Groups
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- Exploiting group symmetry in truss topology optimization
- Fastest Mixing Markov Chain on a Graph
- Group symmetry in interior-point methods for semidefinite program
- 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)- Symmetry reduction to optimize a graph-based polynomial from queueing theory
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Group symmetry and covariance regularization
- Two results on the convex algebraic geometry of sets with continuous symmetries
- Reduction of symmetric semidefinite programs using the regular -representation
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- Q-polynomial coherent configurations
- Semidefinite programs and association schemes
- Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming
- Automorphisms of Rank-One Generated Hyperbolicity Cones and Their Derivative Relaxations
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
- Exploiting symmetry in copositive programs via semidefinite hierarchies
- Symmetry reduction in AM/GM-based optimization
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
- Group symmetry in interior-point methods for semidefinite program
- Reflection groups and cones of sums of squares
- Symmetry groups, semidefinite programs, and sums of squares
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
- Simultaneous singular value decomposition
- On symmetry adapted bases in trigonometric optimization
- Symmetry and Satisfiability: An Update
- DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
- Euclidean designs obtained from spherical embedding of coherent configurations
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
- Certifying the global optimality of quartic minimization over the sphere
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- RepLAB: a computational/numerical approach to representation theory
- Primal-dual interior-point algorithm for symmetric model predictive control
- Tight relative \(t\)-designs on two shells in hypercubes, and Hahn and Hermite polynomials
- Symmetric chains, Gelfand--Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme
- Introduction to semidefinite, conic and polynomial optimization
- Sparse sub-Gaussian random projections for semidefinite programming relaxations
- Symmetry in mathematical programming
- New Bounds for Spherical Two-Distance Sets
- Semidefinite programming for permutation codes
- Decomposed structured subsets for semidefinite and sum-of-squares optimization
- Commutative association schemes
- Dimension reduction for semidefinite programs via Jordan algebras
- Invariant Semidefinite Programs
- Symmetries in polynomial optimization
- On symmetry groups of some quadratic programming problems
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)
