66 citations · 187 across the 28 of their papers we have counts for
Showing 2015 · math.OCShow all
2 papers · 2 filters
math.OC2015★ 35 cited
On the Turing model complexity of interior point methods for semidefinite programming
Etienne de Klerk, Frank Vallentin
It is known that one can solve semidefinite programs to within fixed accuracy in polynomial time using the ellipsoid method (under some assumptions). In this paper it is shown that…
math.OC2015
Bound-constrained polynomial optimization using only elementary calculations
Etienne de Klerk, Jean Lasserre, Monique Laurent +1
We provide a monotone non increasing sequence of upper bounds () converging to the global minimum of a polynomial on simple sets like the unit hypercube. The no…