D. de Laat
10 records found
1
We study a primal-dual interior point method specialized to clustered low-rank semidefinite programs requiring high precision numerics, which arise from certain multivariate polynomial (matrix) programs through sums-of-squares characterizations and sampling. We consider the inter
...
In this paper we give an algorithm to round the floating point output of a semidefinite programming solver to a solution over the rationals or a quadratic extension of the rationals. This algorithm does not require the solution to be strictly feasible and works for large problems
...
We propose a hierarchy of k-point bounds extending the Delsarte–Goethals–Seidel linear programming 2-point bound and the Bachoc–Vallentin semidefinite programming 3-point bound for spherical codes. An optimized implementation of this hierarchy allows us to compute 4, 5, and 6-poi
...
Assuming the generalized Riemann hypothesis, we give asymptotic bounds on the size of intervals that contain primes from a given arithmetic progression using the approach developed by Carneiro, Milinovich and Soundararajan [Comment. Math. Helv. 94, no. 3 (2019)]. For this we exte
...
In this paper we study the distribution of the non-trivial zeros of the Riemann zeta-function (and other L-functions) using Montgomery's pair correlation approach. We use semidefinite programming to improve upon numerous asymptotic bounds in the theory of the zeta-function, inclu
...
We carry out a numerical study of the spinless modular bootstrap for conformal field theories with current algebra U(1)c× U(1)c, or equivalently the linear programming bound for sphere packing in 2c dimensions. We give a more detailed picture of the behavior
...
We use moment techniques to construct a converging hierarchy of optimization problems to lower bound the ground state energy of interacting particle systems. We approximate (from below) the infinite-dimensional optimization problems in this hierarchy by block diagonal semidefinit
...