Search filters

List of works by Etienne de Klerk

A PTAS for the minimization of polynomials of fixed degree over the simplex

scientific article published in 2006

A linear programming reformulation of the standard quadratic optimization problem

article by Etienne de Klerk & Dmitrii V. Pasechnik published 21 July 2006 in Journal of Global Optimization

A note on the stability number of an orthogonality graph

Approximation of the Stability Number of a Graph via Copositive Programming

Book drawings of complete bipartite graphs

article by Etienne de Klerk et al published April 2014 in Discrete Applied Mathematics

Bound-Constrained Polynomial Optimization Using Only Elementary Calculations

scientific article published in 2017

Comparison of Lasserre’s Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing

Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere

scientific article published in 2020

Distributionally robust optimization with polynomial densities: theory, models and algorithms

scientific article published in 2019

Exploiting group symmetry in truss topology optimization

Improved Bounds for the Crossing Numbers of Km,n and Kn

Improved Lower Bounds for the 2-Page Crossing Numbers of $K_{m,n}$ and $K_n$ via Semidefinite Programming

Improved Lower Bounds on Book Crossing Numbers of Complete Graphs

Numerical block diagonalization of matrix *-algebras with application to semidefinite programming

scholarly article by Etienne de Klerk et al published 22 May 2011 in Mathematical Programming

On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the θ-Function

On Semidefinite Programming Relaxations of the Traveling Salesman Problem

On semidefinite programming relaxations of maximum $$k$$ -section

On the Lovász ϑ -number of almost regular graphs with application to Erdős–Rényi graphs

article by Etienne de Klerk et al published May 2009 in European Journal of Combinatorics

Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms

Reduction of symmetric semidefinite programs using the regular $$\ast$$ -representation

article

Relaxations of Combinatorial Problems Via Association Schemes