Symmetry in semidefinite programs
From MaRDI portal
Publication:958029
DOI10.1016/j.laa.2008.07.025zbMath1165.90017arXiv0706.4233OpenAlexW2000998728MaRDI QIDQ958029
Publication date: 2 December 2008
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0706.4233
Terwilliger algebrasemidefinite programmingblock diagonalizationHahn polynomialsbinary Hamming scheme
Related Items
\(Q\)-polynomial coherent configurations, Symmetry in Mathematical Programming, New Bounds for Spherical Two-Distance Sets, Certifying the global optimality of quartic minimization over the sphere, Tight relative t-designs on two shells in hypercubes, and Hahn and Hermite polynomials, Automorphisms of Rank-One Generated Hyperbolicity Cones and Their Derivative Relaxations, Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs, Dimension reduction for semidefinite programs via Jordan algebras, Reflection groups and cones of sums of squares, A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming, 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, Simultaneous singular value decomposition, Group symmetry and covariance regularization, Symmetric chains, Gelfand--Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme, DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization, Semidefinite programming for permutation codes, Reformulations in mathematical programming: automatic symmetry detection and exploitation, Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming, Introduction to Semidefinite, Conic and Polynomial Optimization, Invariant Semidefinite Programs, Decomposed structured subsets for semidefinite and sum-of-squares optimization, Commutative association schemes, Exploiting special structure in semidefinite programming: a survey of theory and applications, RepLAB: A Computational/Numerical Approach to Representation Theory, Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory, Exploiting symmetry in copositive programs via semidefinite hierarchies
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
- Strengthened semidefinite programming bounds for codes
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
- Exploiting group symmetry in truss topology optimization
- Group symmetry in interior-point methods for semidefinite program
- Symmetry groups, semidefinite programs, and sums of squares
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- New upper bounds for kissing numbers from semidefinite programming
- Fastest Mixing Markov Chain on a Graph
- Computing Irreducible Representations of Finite Groups
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
