Invariant Semidefinite Programs
From MaRDI portal
Publication:2802527
DOI10.1007/978-1-4614-0769-0_9zbMath1334.90097arXiv1007.2905OpenAlexW3104971636MaRDI QIDQ2802527
Frank Vallentin, Dion C. Gijswijt, Christine Bachoc, Alexander Schrijver
Publication date: 26 April 2016
Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.2905
Semidefinite programming (90C22) Applications of mathematical programming (90C90) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Related Items
Algebras, graphs and thetas, Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank, Symmetry in Turán sums of squares polynomials from flag algebras, New Bounds for Spherical Two-Distance Sets, Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software, A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives, The independence number for polarity graphs of even order planes, Symmetry Reduction in AM/GM-Based Optimization, Spectral representations of vertex transitive graphs, Archimedean solids and finite Coxeter groups, 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, Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools, Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs, One more proof of the first linear programming bound for binary codes and two conjectures, Dimension reduction for semidefinite programs via Jordan algebras, Least distortion Euclidean embeddings of flat tori, Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022, Characterizing the universal rigidity of generic tensegrities, Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting), Symmetric sums of squares over \(k\)-subset hypercubes, Exploiting symmetry in integer convex optimization using core points, Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling, Orbital geometry and group majorisation in optimisation, Towards a proof of the 24-cell conjecture, Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry, Semidefinite programming bounds for Lee codes, Symmetry Adapted Gram Spectrahedra, Unnamed Item, Johnson type bounds for mixed dimension subspace codes, \(\Aut(\mathbb{F}_5)\) has property \((T)\), Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory, On matrix algebras associated to sum-of-squares semidefinite programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear programming bounds for unitary codes
- Bounds for binary codes relative to pseudo-distances of \(k\) points
- Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\)
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
- 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
- Symmetry in semidefinite programs
- A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming
- Block-diagonal semidefinite programming hierarchies for 0/1 programming
- Optimality and uniqueness of the \((4,10,1/6)\) spherical code
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
- On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs
- Unitary designs and codes
- Exploiting group symmetry in truss topology optimization
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- Lower bounds for measurable chromatic numbers
- On the nonbinary Johnson scheme
- Alternating bilinear forms over GF(q)
- Spherical codes and designs
- Bilinear forms over a finite field, with applications to coding theory
- New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
- Upper bounds on permutation codes via linear programming
- The sandwich theorem
- Girth and Euclidean distortion
- Group symmetry in interior-point methods for semidefinite program
- Symmetry groups, semidefinite programs, and sums of squares
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
- Optimal distortion embeddings of distance regular graphs into Euclidean spaces
- A note on the stability number of an orthogonality graph
- Two-point homogeneous spaces
- Positive definite functions on spheres
- Linear programming bounds for codes in grassmannian spaces
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- New upper bounds for kissing numbers from semidefinite programming
- High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
- Sums of squares and moment problems in equivariant situations
- The Operator $\Psi$ for the Chromatic Number of a Graph
- Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization
- On Semidefinite Programming Relaxations of the Traveling Salesman Problem
- Bounds on ordered codes and orthogonal arrays
- THE LEE-SCHEME AND BOUNDS FOR LEE-CODES
- On the Shannon capacity of a graph
- Association Schemes for Ordered Orthogonal Arrays and (T, M, S)-Nets
- Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
- A Panoramic View of Riemannian Geometry
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Generalized Jacobi Polynomials as Spherical Functions of the Grassmann Manifold
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Semidefinite Code Bounds Based on Quadruple Distances
- Improved Bounds for the Crossing Numbers of Km,n and Kn
- The crossing number of K5,n
- Symmetry Analysis of Reversible Markov Chains
- A GAP Package for Computation with Coherent Configurations
- On a problem of P. Turan concerning graphs
- Hahn Polynomials, Discrete Harmonics, andt-Designs
- Algorithms in invariant theory
- \(C^*\)-algebras by example