Invariant Semidefinite Programs
From MaRDI portal
Publication:2802527
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.
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
Cites work
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 3121286 (Why is no real title available?)
- scientific article; zbMATH DE number 3925109 (Why is no real title available?)
- scientific article; zbMATH DE number 3775586 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 3510705 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3634289 (Why is no real title available?)
- scientific article; zbMATH DE number 1224949 (Why is no real title available?)
- scientific article; zbMATH DE number 1231230 (Why is no real title available?)
- scientific article; zbMATH DE number 1284419 (Why is no real title available?)
- scientific article; zbMATH DE number 711688 (Why is no real title available?)
- scientific article; zbMATH DE number 1022658 (Why is no real title available?)
- scientific article; zbMATH DE number 1981748 (Why is no real title available?)
- scientific article; zbMATH DE number 1757962 (Why is no real title available?)
- scientific article; zbMATH DE number 1860211 (Why is no real title available?)
- scientific article; zbMATH DE number 2120949 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- scientific article; zbMATH DE number 3037624 (Why is no real title available?)
- A GAP Package for Computation with Coherent Configurations
- A Panoramic View of Riemannian Geometry
- A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming
- A note on the stability number of an orthogonality graph
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
- Advances in convex optimization: conic programming
- Algorithms in invariant theory
- Alternating bilinear forms over GF(q)
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
- Association Schemes for Ordered Orthogonal Arrays and (T, M, S)-Nets
- Bilinear forms over a finite field, with applications to coding theory
- Block-diagonal semidefinite programming hierarchies for 0/1 programming
- Bounds for binary codes relative to pseudo-distances of \(k\) points
- Bounds on ordered codes and orthogonal arrays
- Codes on Euclidean spheres
- Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization
- Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
- 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
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\)
- Generalized Jacobi Polynomials as Spherical Functions of the Grassmann Manifold
- Girth and Euclidean distortion
- Group symmetry in interior-point methods for semidefinite program
- Hahn Polynomials, Discrete Harmonics, andt-Designs
- High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
- Improved Bounds for the Crossing Numbers of Km,n and Kn
- Linear programming bounds for codes in grassmannian spaces
- Linear programming bounds for unitary codes
- Lower bounds for measurable chromatic numbers
- Multivariate positive definite functions on spheres
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
- New upper bounds for kissing numbers from semidefinite programming
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
- On Semidefinite Programming Relaxations of the Traveling Salesman Problem
- On a problem of P. Turan concerning graphs
- On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs
- On the Shannon capacity of a graph
- On the nonbinary Johnson scheme
- Optimal distortion embeddings of distance regular graphs into Euclidean spaces
- Optimality and uniqueness of the \((4,10,1/6)\) spherical code
- Positive definite functions on spheres
- Reduction of symmetric semidefinite programs using the regular -representation
- Semidefinite Code Bounds Based on Quadruple Distances
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
- Spherical codes and designs
- Strengthened semidefinite programming bounds for codes
- Sums of squares and moment problems in equivariant situations
- Sums of squares, moment matrices and optimization over polynomials
- Symmetry Analysis of Reversible Markov Chains
- Symmetry groups, semidefinite programs, and sums of squares
- Symmetry in semidefinite programs
- THE LEE-SCHEME AND BOUNDS FOR LEE-CODES
- The Operator $\Psi$ for the Chromatic Number of a Graph
- The crossing number of K5,n
- The sandwich theorem
- Two-point homogeneous spaces
- Unitary designs and codes
- Upper bounds on permutation codes via linear programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- \(C^*\)-algebras by example
Cited in
(36)- Symmetry reduction to optimize a graph-based polynomial from queueing theory
- Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools
- One more proof of the first linear programming bound for binary codes and two conjectures
- A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
- Towards a proof of the 24-cell conjecture
- Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
- Algebras, graphs and thetas
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
- 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
- Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank
- Semidefinite programming bounds for Lee codes
- Symmetry reduction in AM/GM-based optimization
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
- 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
- On the number of matrices to generate a matrix \(\ast\)-algebra over the real field
- Linear programming with unitary-equivariant constraints
- Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling
- Symmetry adapted Gram spectrahedra
- The independence number for polarity graphs of even order planes
- Clustering is semidefinitely not that hard: nonnegative SDP for manifold disentangling
- 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
- scientific article; zbMATH DE number 5564089 (Why is no real title available?)
- Spectral representations of vertex transitive graphs, Archimedean solids and finite Coxeter groups
- Dimension reduction for semidefinite programs via Jordan algebras
- Johnson type bounds for mixed dimension subspace codes
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)
