18 citations · 18 across the 4 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2021
Improved Lower Bounds for Global Polynomial Optimisation
Henning Seidler
We present a branch-and-bound algorithm to improve the lower bounds obtained by SONC/SAGE. The running time is fixed-parameter tractable in the number of variables. Furthermore, we…
math.OC2018★ 18 cited
An Experimental Comparison of SONC and SOS Certificates for Unconstrained Optimization
Henning Seidler, Timo de Wolff
Finding the minimum of a multivariate real polynomial is a well-known hard problem with various applications. We present a polynomial time algorithm to approximate such lower bound…