64 citations · 127 across the 14 of their papers we have counts for
Showing 2023Show 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.CO2023
Semidefinite approximations for bicliques and biindependent pairs
Monique Laurent, Sven Polak, Luis Felipe Vargas
We investigate some graph parameters dealing with biindependent pairs in a bipartite graph , i.e., pairs where , …