Invariant Semidefinite Programs

DOI10.1007/978-1-4614-0769-0_9zbMATH Open1334.90097arXiv1007.2905OpenAlexW3104971636MaRDI QIDQ2802527FDOQ2802527

Authors: Christine Bachoc, Dion Gijswijt, Frank Vallentin, Alexander Schrijver 

Publication date: 26 April 2016

Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)

Abstract: In the last years many results in the area of semidefinite programming were obtained for invariant (finite dimensional, or infinite dimensional) semidefinite programs - SDPs which have symmetry. This was done for a variety of problems and applications. The purpose of this handbook chapter is to give the reader the necessary background for dealing with semidefinite programs which have symmetry. Here the basic theory is given and it is illustrated in applications from coding theory, combinatorics, geometry, and polynomial optimization.

Full work available at URL: https://arxiv.org/abs/1007.2905

Recommendations

• Semidefinite programming
• scientific article; zbMATH DE number 1047682
• Semidefinite programming
• Semidefinite Programming
• scientific article; zbMATH DE number 5564089
• Inverse optimization in semi-infinite linear programs
• scientific article; zbMATH DE number 1985305
• Semidefinite relaxations for semi-infinite polynomial programming
• Semidefinite programming and integer programming
• On a structured semidefinite program

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Semidefinite programming (90C22) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Cites Work

• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Shannon capacity of a graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Exploiting group symmetry in truss topology optimization
• Exploiting special structure in semidefinite programming: a survey of theory and applications
• Bilinear forms over a finite field, with applications to coding theory
• Group symmetry in interior-point methods for semidefinite program
• Symmetry groups, semidefinite programs, and sums of squares
• Positive definite functions on spheres
• Sums of squares, moment matrices and optimization over polynomials
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Panoramic View of Riemannian Geometry
• Title not available (Why is that?)
• Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
• Title not available (Why is that?)
• Hahn Polynomials, Discrete Harmonics, andt-Designs
• \(C^*\)-algebras by example
• Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\)
• Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
• Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
• Title not available (Why is that?)
• Alternating bilinear forms over GF(q)
• The Operator $\Psi$ for the Chromatic Number of a Graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Advances in convex optimization: conic programming
• Spherical codes and designs
• The sandwich theorem
• Two-point homogeneous spaces
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• Title not available (Why is that?)
• Semidefinite Code Bounds Based on Quadruple Distances
• Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
• Strengthened semidefinite programming bounds for codes
• Optimality and uniqueness of the \((4,10,1/6)\) spherical code
• New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
• Title not available (Why is that?)
• Algorithms in invariant theory
• Lower bounds for measurable chromatic numbers
• New upper bounds for kissing numbers from semidefinite programming
• Block-diagonal semidefinite programming hierarchies for 0/1 programming
• Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
• Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization
• On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs
• Upper bounds on permutation codes via linear programming
• Girth and Euclidean distortion
• On the nonbinary Johnson scheme
• Multivariate positive definite functions on spheres
• A note on the stability number of an orthogonality graph
• Bounds on ordered codes and orthogonal arrays
• Association Schemes for Ordered Orthogonal Arrays and (T, M, S)-Nets
• Symmetry Analysis of Reversible Markov Chains
• New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
• Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
• The crossing number of K5,n
• Linear programming bounds for codes in grassmannian spaces
• Sums of squares and moment problems in equivariant situations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Improved Bounds for the Crossing Numbers of Km,n and Kn
• On a problem of P. Turan concerning graphs
• On Semidefinite Programming Relaxations of the Traveling Salesman Problem
• Codes on Euclidean spheres
• Generalized Jacobi Polynomials as Spherical Functions of the Grassmann Manifold
• Title not available (Why is that?)
• Title not available (Why is that?)
• High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
• Unitary designs and codes
• Linear programming bounds for unitary codes
• Bounds for binary codes relative to pseudo-distances of \(k\) points
• A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
• Symmetry in semidefinite programs
• Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
• A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming
• THE LEE-SCHEME AND BOUNDS FOR LEE-CODES
• Title not available (Why is that?)
• Optimal distortion embeddings of distance regular graphs into Euclidean spaces
• A GAP Package for Computation with Coherent Configurations

Cited In (36)

• Symmetry reduction to optimize a graph-based polynomial from queueing theory
• One more proof of the first linear programming bound for binary codes and two conjectures
• Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools
• A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
• Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
• Towards a proof of the 24-cell conjecture
• Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
• Algebras, graphs and thetas
• Least distortion Euclidean embeddings of flat tori
• \(\Aut(\mathbb{F}_5)\) has property \((T)\)
• Orbital geometry and group majorisation in optimisation
• Symmetric sums of squares over \(k\)-subset hypercubes
• Exploiting symmetry in integer convex optimization using core points
• Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
• Symmetry reduction in AM/GM-based optimization
• Semidefinite programming bounds for Lee codes
• Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank
• Characterizing the universal rigidity of generic tensegrities
• Symmetry groups, semidefinite programs, and sums of squares
• Symmetric SAGE and SONC forms, exactness and quantitative gaps
• Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software
• New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry
• Linear programming with unitary-equivariant constraints
• On the number of matrices to generate a matrix \(\ast\)-algebra over the real field
• Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling
• Symmetry adapted Gram spectrahedra
• Clustering is semidefinitely not that hard: nonnegative SDP for manifold disentangling
• The independence number for polarity graphs of even order planes
• New Bounds for Spherical Two-Distance Sets
• Symmetry in Turán sums of squares polynomials from flag algebras
• Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting)
• On matrix algebras associated to sum-of-squares semidefinite programs
• Title not available (Why is that?)
• Dimension reduction for semidefinite programs via Jordan algebras
• Spectral representations of vertex transitive graphs, Archimedean solids and finite Coxeter groups
• Johnson type bounds for mixed dimension subspace codes

Uses Software

• GAP
• SeDuMi
• Cohcfg

This page was built for publication: Invariant Semidefinite Programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802527)