21 citations · 50 across the 18 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.AG2023★ 15 cited
Degree bounds for Putinar's Positivstellensatz on the hypercube
Lorenzo Baldi, Lucas Slot
The Positivstellensätze of Putinar and Schmüdgen show that any polynomial positive on a compact semialgebraic set can be represented using sums of squares. Recently, there has…