64 citations · 127 across the 14 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2023
A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization
Sander Gribling, Sven Polak, Lucas Slot
The moment-sum-of-squares (moment-SOS) hierarchy is one of the most celebrated and widely applied methods for approximating the minimum of an n-variate polynomial over a feasible r…
math.OC2021
Mutually unbiased bases: polynomial optimization and symmetry
Sander Gribling, Sven Polak
A set of orthonormal bases of is called mutually unbiased if whenever and are basis vectors in distinct bases. A natural q…