42 citations · 42 across the 4 of their papers we have counts for
Showing 2018 · math.OCShow all
2 papers · 2 filters
math.OC2018
Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization
Riley Badenbroek, Etienne de Klerk
We develop a short-step interior point method to optimize a linear function over a convex body assuming that one only knows a membership oracle for this body. The approach is based…
math.OC2018
Worst-case examples for Lasserre's measure--based hierarchy for polynomial optimization on the hypercube
Etienne de Klerk, Monique Laurent
We study the convergence rate of a hierarchy of upper bounds for polynomial optimization problems, proposed by Lasserre [SIAM J. Optim. 21(3) (2011), pp. 864-885], and a related hi…