Strengthened semidefinite programming bounds for codes

DOI10.1007/s10107-006-0030-3zbMath1147.90034OpenAlexW2121547771MaRDI QIDQ868466

Monique Laurent

Publication date: 5 March 2007

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-006-0030-3

zbMATH Keywords

Terwilliger algebrasemidefinite programmingstability numberbinary coderegular \(*\)-representation

Mathematics Subject Classification ID

Semidefinite programming (90C22) Combinatorial optimization (90C27) Bounds on codes (94B65)

Related Items

Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems, Copositive programming motivated bounds on the stability and the chromatic numbers, Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation, Semidefinite bounds for the stability number of a graph via sums of squares of polynomials, Semidefinite programming bounds for binary codes from a split Terwilliger algebra, Symmetric sums of squares over \(k\)-subset hypercubes, Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling, Symmetry in semidefinite programs, Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming, Block-diagonal semidefinite programming hierarchies for 0/1 programming, Invariant Semidefinite Programs, Commutative association schemes, Exploiting special structure in semidefinite programming: a survey of theory and applications, 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
• The subconstituent algebra of an association scheme. I
• Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
• Geometric algorithms and combinatorial optimization
• Symmetry groups, semidefinite programs, and sums of squares
• A note on the stability number of an orthogonality graph
• Global Optimization with Polynomials and the Problem of Moments
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• A comparison of the Delsarte and Lovász bounds
• Cones of Matrices and Set-Functions and 0–1 Optimization
• On the Shannon capacity of a graph
• A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming