Symmetry in semidefinite programs
From MaRDI portal
Publication:958029
DOI10.1016/J.LAA.2008.07.025zbMATH Open1165.90017arXiv0706.4233OpenAlexW2000998728MaRDI QIDQ958029FDOQ958029
Authors: Frank Vallentin 
Publication date: 2 December 2008
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/0706.4233
Recommendations
- Handling symmetries in mixed-integer semidefinite programs
- scientific article
- 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
semidefinite programmingTerwilliger algebraHahn polynomialsblock diagonalizationbinary Hamming scheme
Cites Work
- Title not available (Why is that?)
- Exploiting group symmetry in truss topology optimization
- Group symmetry in interior-point methods for semidefinite program
- Symmetry groups, semidefinite programs, and sums of squares
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- Strengthened semidefinite programming bounds for codes
- New upper bounds for kissing numbers from semidefinite programming
- Fastest Mixing Markov Chain on a Graph
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
- Computing Irreducible Representations of Finite Groups
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (37)
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Group symmetry and covariance regularization
- RepLAB: A Computational/Numerical Approach to Representation Theory
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
- Tight relative t-designs on two shells in hypercubes, and Hahn and Hermite polynomials
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
- \(Q\)-polynomial coherent configurations
- Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- Semidefinite programs and association schemes
- 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
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
- Reflection groups and cones of sums of squares
- Group symmetry in interior-point methods for semidefinite program
- 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
- Euclidean designs obtained from spherical embedding of coherent configurations
- Certifying the global optimality of quartic minimization over the sphere
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
- Primal-dual interior-point algorithm for symmetric model predictive control
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- Introduction to semidefinite, conic and polynomial optimization
- Symmetric chains, Gelfand--Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme
- Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory
- 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
- 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)
