no code implementations • 4 Mar 2021 • Felix Kirschner, Etienne de Klerk
For the GMP over the simplex we prove a convergence rate of $O(1/r)$ for a linear programming, RLT-type hierarchy, where $r$ is the level of the hierarchy, using a quantitative version of P\'olya's Positivstellensatz.
Optimization and Control
no code implementations • 2 Aug 2019 • Daniel Brosch, Etienne de Klerk
We consider three known bounds for the quadratic assignment problem (QAP): an eigenvalue, a convex quadratic programming (CQP), and a semidefinite programming (SDP) bound.
Optimization and Control 90C22, 90C10
1 code implementation • 15 Sep 2017 • Etienne de Klerk, Francois Glineur, Adrien Taylor
To illustrate the applicability of the tools, we demonstrate a novel complexity analysis of short step interior point methods using inexact search directions.
Optimization and Control 90C22, 90C26, 90C30