Showing 2025Show all
2 papers · 1 filter
math.OC2025
On the convergence rate of the boosted Difference-of-Convex Algorithm (DCA)
Hadi Abbaszadehpeivasti, Etienne de Klerk, Adrien Taylor
The difference-of-convex algorithm (DCA) is a well-established nonlinear programming technique that solves successive convex optimization problems. These sub-problems are obtained…
math.OC2025
Revisiting the convergence rate of the Lasserre hierarchy for polynomial optimization over the hypercube
Sander Gribling, Etienne de Klerk, Juan Vera
We revisit the problem of minimizing a given polynomial on the hypercube . Lasserre's hierarchy (also known as the moment- or sum-of-squares hierarchy) provides a seq…