19 citations · 25 across the 7 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
math.OC2023★ 1 cited
Piecewise Polynomial Regression of Tame Functions via Integer Programming
Gilles Bareilles, Johannes Aspman, Jiri Nemecek +1
Tame functions are a class of nonsmooth, nonconvex functions, which feature in a wide range of applications: functions encountered in the training of deep neural networks with all…
math.OC2023★ 1 cited
Hybrid Methods in Polynomial Optimisation
Johannes Aspman, Gilles Bareilles, Vyacheslav Kungurtsev +2
The Moment/Sum-of-squares hierarchy provides a way to compute the global minimizers of polynomial optimization problems (POP), at the cost of solving a sequence of increasingly lar…