Strengthened semidefinite programming bounds for codes
From MaRDI portal
Publication:868466
DOI10.1007/S10107-006-0030-3zbMATH Open1147.90034OpenAlexW2121547771MaRDI QIDQ868466FDOQ868466
Authors: 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
Recommendations
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- Bounds for codes by semidefinite programming
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
- Semidefinite bounds for nonbinary codes based on quadruples
- Semidefinite bounds for mixed binary/ternary codes
Cites Work
- Geometric algorithms and combinatorial optimization
- Global optimization with polynomials and the problem of moments
- On the Shannon capacity of a graph
- The subconstituent algebra of an association scheme. I
- Symmetry groups, semidefinite programs, and sums of squares
- Cones of Matrices and Set-Functions and 0–1 Optimization
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- Title not available (Why is that?)
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
- Title not available (Why is that?)
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- A comparison of the Delsarte and Lovász bounds
- Title not available (Why is that?)
- A note on the stability number of an orthogonality graph
- Title not available (Why is that?)
Cited In (27)
- Symmetry reduction to optimize a graph-based polynomial from queueing theory
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- Semidefinite bounds for mixed binary/ternary codes
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- Semidefinite programming bounds for binary codes from a split Terwilliger algebra
- Bounds for codes by semidefinite programming
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
- Exploiting symmetry in copositive programs via semidefinite hierarchies
- Symmetric sums of squares over \(k\)-subset hypercubes
- New lower bounds on crossing numbers of \(K_{m,n}\) from semidefinite programming
- Semidefinite programming bounds for Lee codes
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
- Copositive programming motivated bounds on the stability and the chromatic numbers
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
- New and updated semidefinite programming bounds for subspace codes
- Semidefinite bounds for nonbinary codes based on quadruples
- Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling
- Symmetry in semidefinite programs
- New code upper bounds for the folded \(n\)-cube
- Block-diagonal semidefinite programming hierarchies for 0/1 programming
- Bounds for projective codes from semidefinite programming
- Commutative association schemes
- New upper bounds on codes via association schemes and linear programming
- Invariant Semidefinite Programs
This page was built for publication: Strengthened semidefinite programming bounds for codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868466)
