References and citing

The semidefinite programming solver and the interface (including sampled polynomials) in ClusteredLowRankSolver.jl have been developed as part of the paper

The solver was inspired by the more specialized solver

The rounding procedure in ClusteredLowRankSolver.jl has been developed as part of the paper

This improves the rounding procedure developed in

References

[1]
H. Cohn, D. de Laat and N. Leijenhorst. Optimality of spherical codes via exact semidefinite programming bounds, arXiv:2403.16874 (2024).
[2]
N. Leijenhorst and D. de Laat. Solving clustered low-rank semidefinite programs arising from polynomial optimization. Mathematical Programming Computation 16, 503–534 (2024), arXiv:2202.12077.
[3]
[4]
P. Delsarte, J. M. Goethals and J. J. Seidel. Spherical codes and designs. Geometriae Dedicata 6, 363–388 (1977).
[5]
D. de Laat, F. M. de Oliveira Filho and F. Vallentin. Upper bounds for packings of spheres of several radii. Forum of Mathematics, Sigma 2, e23 (2014).
[6]
[7]