E
Etienne de Klerk
Researcher at Tilburg University
Publications - 110
Citations - 2392
Etienne de Klerk is an academic researcher from Tilburg University. The author has contributed to research in topics: Semidefinite programming & Rate of convergence. The author has an hindex of 23, co-authored 101 publications receiving 2126 citations. Previous affiliations of Etienne de Klerk include University of Waterloo & Delft University of Technology.
Papers
More filters
Book
Aspects of semidefinite programming : interior point algorithms and selected applications
TL;DR: The Primal Logarithmic Barrier Method and Primal-Dual Affine-Scaling Methods are presented, as well as some alternative methods for reducing the number of coefficients in a graph, using the Lovasz upsilon function.
Journal ArticleDOI
Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive Programming
TL;DR: This paper shows how to approximate the optimal solution by approximating the cone of copositive matrices via systems of linear inequalities, and, more refined, linear matrix inequalities (LMI's).
Journal ArticleDOI
On Copositive Programming and Standard Quadratic Optimization Problems
TL;DR: The primal-dual affine scaling directions are used to escape from local maxima encountered during the evolutionary dynamics phase, and are combined with an evolutionary dynamics algorithm which generates primal-feasible paths along which the objective is monotonically improved until a local solution is reached.
Journal ArticleDOI
Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
Etienne de Klerk,Renata Sotirov +1 more
TL;DR: In this paper, the authors consider semidefinite programming relaxations of the quadratic assignment problem and show how to exploit group symmetry in the problem data to compute the best known lower bounds.
Journal ArticleDOI
Reduction of symmetric semidefinite programs using the regular $$\ast$$-representation
TL;DR: A general technique to reduce the size ofSemidefinite programming problems on which a permutation group is acting is described, based on a low-order matrix based on the representation of the commutant (centralizer ring) of the matrix algebra generated by the permutation matrices.