181 citations · 332 across the 25 of their papers we have counts for
4 papers · 1 filter
Self-concordant Schrödinger operators: spectral gaps and optimization without condition numbers
Sander Gribling, Simon Apers, Harold Nieuwboer +1
Spectral gaps play a fundamental role in many areas of mathematics, computer science, and physics. In quantum mechanics, the spectral gap of Schrödinger operators has a long histor…
Revisiting the convergence rate of the Lasserre hierarchy for polynomial optimization over the hypercube
Sander Gribling, Etienne de Klerk, Juan Vera
We revisit the problem of minimizing a given polynomial on the hypercube . Lasserre's hierarchy (also known as the moment- or sum-of-squares hierarchy) provides a seq…
Improved approximation ratios for the Quantum Max-Cut problem on general, triangle-free and bipartite graphs
Sander Gribling, Lennart Sinjorgo, Renata Sotirov
We study polynomial-time approximation algorithms for the Quantum Max-Cut (QMC) problem. Given an edge-weighted graph on n vertices, the QMC problem is to determine the largest…
How to compute the volume in low dimension?
Arjan Cornelissen, Simon Apers, Sander Gribling
Estimating the volume of a convex body is a canonical problem in theoretical computer science. Its study has led to major advances in randomized algorithms, Markov chain theory, an…