Etienne de Klerk

According to our database1, Etienne de Klerk authored at least 62 papers between 1997 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix.
INFORMS J. Comput., 2022

2020
Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation.
SIAM J. Optim., 2020

Distributionally robust optimization with polynomial densities: theory, models and algorithms.
Math. Program., 2020

Worst-Case Examples for Lasserre's Measure-Based Hierarchy for Polynomial Optimization on the Hypercube.
Math. Oper. Res., 2020

Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy.
Discret. Appl. Math., 2020

2019
Polynomial Norms.
SIAM J. Optim., 2019

2018
Comparison of Lasserre's Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing.
Math. Oper. Res., 2018

A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem.
Ann. Oper. Res., 2018

2017
Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization.
SIAM J. Optim., 2017

On the convergence rate of grid search for polynomial optimization over the simplex.
Optim. Lett., 2017

On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions.
Optim. Lett., 2017

Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization.
Math. Program., 2017

Bound-Constrained Polynomial Optimization Using Only Elementary Calculations.
Math. Oper. Res., 2017

2016
On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming.
SIAM J. Optim., 2016

Book Review by Etienne de Klerk "An Introduction to Polynomial and Semi-Algebraic Optimization" by Jean-Bernard Lasserre, Cambridge University Press, 2015.
Eur. J. Oper. Res., 2016

2015
An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution.
SIAM J. Optim., 2015

An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex.
Math. Program., 2015

A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives.
INFORMS J. Comput., 2015

2014
Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems.
Eur. J. Oper. Res., 2014

Book drawings of complete bipartite graphs.
Discret. Appl. Math., 2014

2013
Improved Lower Bounds on Book Crossing Numbers of Complete Graphs.
SIAM J. Discret. Math., 2013

Special issue in honour of Professor Kees Roos' 70th Birthday.
Optim. Methods Softw., 2013

On semidefinite programming bounds for graph bandwidth.
Optim. Methods Softw., 2013

2012
Improved Lower Bounds for the 2-Page Crossing Numbers of K<sub>m, n</sub> and K<sub>n</sub> via Semidefinite Programming.
SIAM J. Optim., 2012

Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry.
Math. Program., 2012

On semidefinite programming relaxations of maximum $$k$$ -section.
Math. Program., 2012

2011
On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems.
SIAM J. Optim., 2011

On the complexity of computing the handicap of a sufficient matrix.
Math. Program., 2011

Numerical block diagonalization of matrix *-algebras with application to semidefinite programming.
Math. Program., 2011

Preface.
Math. Program., 2011

A comparison of lower bounds for the symmetric circulant traveling salesman problem.
Discret. Appl. Math., 2011

2010
Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube.
SIAM J. Optim., 2010

Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster.
Optim. Methods Softw., 2010

Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem.
Math. Program., 2010

Exploiting special structure in semidefinite programming: A survey of theory and applications.
Eur. J. Oper. Res., 2010

2009
Erratum: On Semidefinite Programming Relaxations of the Traveling Salesman Problem.
SIAM J. Optim., 2009

A new library of structured semidefinite programming instances.
Optim. Methods Softw., 2009

On the Lovász theta-number of almost regular graphs with application to Erdos-Rényi graphs.
Eur. J. Comb., 2009

2008
On Semidefinite Programming Relaxations of the Traveling Salesman Problem.
SIAM J. Optim., 2008

On the complexity of optimization over the standard simplex.
Eur. J. Oper. Res., 2008

The complexity of optimizing over a simplex, hypercube or sphere: a short survey.
Central Eur. J. Oper. Res., 2008

2007
Reduction of symmetric semidefinite programs using the regular *-representation.
Math. Program., 2007

Foreword: Special issue on large-scale nonlinear and semidefinite programming.
Math. Program., 2007

A linear programming reformulation of the standard quadratic optimization problem.
J. Glob. Optim., 2007

A note on the stability number of an orthogonality graph.
Eur. J. Comb., 2007

2006
A PTAS for the minimization of polynomials of fixed degree over the simplex.
Theor. Comput. Sci., 2006

Improved Bounds for the Crossing Numbers of <i>K<sub>m, n</sub></i> and <i>K<sub>n</sub></i>.
SIAM J. Discret. Math., 2006

Global optimization of rational functions: a semidefinite programming approach.
Math. Program., 2006

2005
Limiting behavior of the central path in semidefinite optimization.
Optim. Methods Softw., 2005

2004
On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the theta-Function.
J. Comb. Optim., 2004

Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms.
Eur. J. Oper. Res., 2004

2003
On Semidefinite Programming Relaxations of (2+p)-SAT.
Ann. Math. Artif. Intell., 2003

2002
Approximation of the Stability Number of a Graph via Copositive Programming.
SIAM J. Optim., 2002

On the Convergence of the Central Path in Semidefinite Optimization.
SIAM J. Optim., 2002

Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive Programming.
J. Glob. Optim., 2002

2001
A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization.
SIAM J. Optim., 2001

2000
On Copositive Programming and Standard Quadratic Optimization Problems.
J. Glob. Optim., 2000

Relaxations of the Satisfiability Problem Using Semidefinite Programming.
J. Autom. Reason., 2000

1998
Polynomial Primal-Dual Affine Scaling Algorithms in Semidefinite Programming.
J. Comb. Optim., 1998

A nonconvex weighted potential function forpolynomial target following methods.
Ann. Oper. Res., 1998

1997
Initialization in semidefinite programming via a self-dual skew-symmetric embedding.
Oper. Res. Lett., 1997

Optimization of nuclear reactor reloading patterns.
Ann. Oper. Res., 1997


  Loading...