43 citations · 135 across the 14 of their papers we have counts for
3 papers · 1 filter
The Lasserre hierarchy for equiangular lines with a fixed angle
David de Laat, Fabrício Caluza Machado, Willem de Muinck Keizer
We compute the second and third levels of the Lasserre hierarchy for the spherical finite distance problem. A connection is used between invariants in representations of the orthog…
Three-point bounds for sphere packing
Henry Cohn, David de Laat, Andrew Salmon
We define three-point bounds for sphere packing that refine the linear programming bound, and we compute these bounds numerically using semidefinite programming by choosing a trunc…
Solving clustered low-rank semidefinite programs arising from polynomial optimization
Nando Leijenhorst, David de Laat
We study a primal-dual interior point method specialized to clustered low-rank semidefinite programs requiring high precision numerics, which arise from certain multivariate polyno…