Etienne de Klerk

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 29

Top Topics

Convergence Rate

Optimization Problems

Top Venues

Math. Oper. Res.

Publications

Tibor Illés, Florian Jarre, Etienne de Klerk, Goran Lesaja
Conic Optimization and Interior Point Methods: Theory, Computations, and Applications. J. Optim. Theory Appl. 202 (1) (2024)
Mareike Dressler, Simon Foucart, Etienne de Klerk, Mioara Joldes, Jean-Bernard Lasserre, Yuan Xu
Optimization-Aided Construction of Multivariate Chebyshev Polynomials. CoRR (2024)
Hadi Abbaszadehpeivasti, Etienne de Klerk, Moslem Zamani
On the Rate of Convergence of the Difference-of-Convex Algorithm (DCA). J. Optim. Theory Appl. 202 (1) (2024)
Felix Kirschner, Etienne de Klerk
Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming. SIAM J. Optim. 33 (2) (2023)
Didier Henrion, Felix Kirschner, Etienne de Klerk, Milan Korda, Jean-Bernard Lasserre, Victor Magron
Revisiting Semidefinite Programming Approaches to Options Pricing: Complexity and Computational Perspectives. INFORMS J. Comput. 35 (2) (2023)
Hadi Abbaszadehpeivasti, Etienne de Klerk, Moslem Zamani
Conditions for linear convergence of the gradient method for non-convex optimization. Optim. Lett. 17 (5) (2023)
Daniel Brosch, Etienne de Klerk
Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software. Optim. Methods Softw. 37 (6) (2022)
Felix Kirschner, Etienne de Klerk
Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere. Optim. Lett. 16 (8) (2022)
Riley Badenbroek, Etienne de Klerk
Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization. Math. Oper. Res. 47 (1) (2022)
Riley Badenbroek, Etienne de Klerk
An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix. INFORMS J. Comput. 34 (2) (2022)
Daniel Brosch, Etienne de Klerk
Minimum energy configurations on a toric lattice as a quadratic assignment problem. Discret. Optim. 44 (Part) (2022)
Riley Badenbroek, Etienne de Klerk
Simulated Annealing for Convex Optimization: Rigorous Complexity Analysis and Practical Perspectives. J. Optim. Theory Appl. 194 (2) (2022)
Hadi Abbaszadehpeivasti, Etienne de Klerk, Moslem Zamani
The exact worst-case convergence rate of the gradient method with fixed step lengths for L-smooth functions. Optim. Lett. 16 (6) (2022)
Etienne de Klerk, Monique Laurent
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere. Math. Program. 193 (2) (2022)
Etienne de Klerk, Monique Laurent
Worst-Case Examples for Lasserre's Measure-Based Hierarchy for Polynomial Optimization on the Hypercube. Math. Oper. Res. 45 (1) (2020)
Etienne de Klerk, François Glineur, Adrien B. Taylor
Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation. SIAM J. Optim. 30 (3) (2020)
Ahmadreza Marandi, Etienne de Klerk, Joachim Dahl
Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy. Discret. Appl. Math. 275 (2020)
Etienne de Klerk, Daniel Kuhn, Krzysztof Postek
Distributionally robust optimization with polynomial densities: theory, models and algorithms. Math. Program. 181 (2) (2020)
Amir Ali Ahmadi, Etienne de Klerk, Georgina Hall
Polynomial Norms. SIAM J. Optim. 29 (1) (2019)
Ahmadreza Marandi, Joachim Dahl, Etienne de Klerk
A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem. Ann. Oper. Res. 265 (1) (2018)
Etienne de Klerk, Monique Laurent
Comparison of Lasserre's Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing. Math. Oper. Res. 43 (4) (2018)
Etienne de Klerk, Monique Laurent, Zhao Sun
Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization. Math. Program. 162 (1-2) (2017)
Etienne de Klerk, Monique Laurent, Zhao Sun, Juan C. Vera
On the convergence rate of grid search for polynomial optimization over the simplex. Optim. Lett. 11 (3) (2017)
Etienne de Klerk, François Glineur, Adrien B. Taylor
On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions. Optim. Lett. 11 (7) (2017)
Amir Ali Ahmadi, Etienne de Klerk, Georgina Hall
Polynomial Norms. CoRR (2017)
Etienne de Klerk, Jean B. Lasserre, Monique Laurent, Zhao Sun
Bound-Constrained Polynomial Optimization Using Only Elementary Calculations. Math. Oper. Res. 42 (3) (2017)
Etienne de Klerk, Roxana Hess, Monique Laurent
Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization. SIAM J. Optim. 27 (1) (2017)
Etienne de Klerk
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. 249 (2) (2016)
Etienne de Klerk, Frank Vallentin
On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming. SIAM J. Optim. 26 (3) (2016)
Etienne de Klerk, Monique Laurent, Zhao Sun
An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution. SIAM J. Optim. 25 (3) (2015)
Etienne de Klerk, Renata Sotirov, Uwe Truetsch
A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives. INFORMS J. Comput. 27 (2) (2015)
Etienne de Klerk, Monique Laurent, Zhao Sun
An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex. Math. Program. 151 (2) (2015)
Etienne de Klerk, Frank Vallentin
On the Turing model complexity of interior point methods for semidefinite programming. CoRR (2015)
Etienne de Klerk, Marianna E.-Nagy, Renata Sotirov, Uwe Truetsch
Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems. Eur. J. Oper. Res. 233 (3) (2014)
Etienne de Klerk, Dmitrii V. Pasechnik, Gelasio Salazar
Book drawings of complete bipartite graphs. Discret. Appl. Math. 167 (2014)
Etienne de Klerk, Marianna E.-Nagy, Renata Sotirov
On semidefinite programming bounds for graph bandwidth. Optim. Methods Softw. 28 (3) (2013)
Tamás Terlaky, Etienne de Klerk, Goran Lesaja, Dick den Hertog
Special issue in honour of Professor Kees Roos' 70th Birthday. Optim. Methods Softw. 28 (3) (2013)
Etienne de Klerk, Dmitrii V. Pasechnik, Gelasio Salazar
Improved Lower Bounds on Book Crossing Numbers of Complete Graphs. SIAM J. Discret. Math. 27 (2) (2013)
Etienne de Klerk, Dmitrii V. Pasechnik, Renata Sotirov, Cristian Dobre
On semidefinite programming relaxations of maximum $$k$$ -section. Math. Program. 136 (2) (2012)
Etienne de Klerk, Renata Sotirov
Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry. Math. Program. 133 (1-2) (2012)
Etienne de Klerk, Dmitrii V. Pasechnik
via Semidefinite Programming. SIAM J. Optim. 22 (2) (2012)
Miguel F. Anjos, Etienne de Klerk, Franz Rendl
Preface. Math. Program. 129 (1) (2011)
Etienne de Klerk, Cristian Dobre, Dmitrii V. Pasechnik
Numerical block diagonalization of matrix *-algebras with application to semidefinite programming. Math. Program. 129 (1) (2011)
Etienne de Klerk, Cristian Dobre
A comparison of lower bounds for the symmetric circulant traveling salesman problem. Discret. Appl. Math. 159 (16) (2011)
Etienne de Klerk, Marianna E.-Nagy
On the complexity of computing the handicap of a sufficient matrix. Math. Program. 129 (2) (2011)
Etienne de Klerk, Monique Laurent
On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems. SIAM J. Optim. 21 (3) (2011)
Ivan D. Ivanov, Etienne de Klerk
Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster. Optim. Methods Softw. 25 (3) (2010)
Etienne de Klerk, Renata Sotirov
Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem. Math. Program. 122 (2) (2010)
Etienne de Klerk
Exploiting special structure in semidefinite programming: A survey of theory and applications. Eur. J. Oper. Res. 201 (1) (2010)
Etienne de Klerk, Monique Laurent
Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube. SIAM J. Optim. 20 (6) (2010)
Etienne de Klerk, Renata Sotirov
A new library of structured semidefinite programming instances. Optim. Methods Softw. 24 (6) (2009)
Etienne de Klerk, Dmitrii V. Pasechnik, Renata Sotirov
Erratum: On Semidefinite Programming Relaxations of the Traveling Salesman Problem. SIAM J. Optim. 20 (2) (2009)
Etienne de Klerk, M. W. Newman, Dmitrii V. Pasechnik, Renata Sotirov
On the Lovász theta-number of almost regular graphs with application to Erdos-Rényi graphs. Eur. J. Comb. 30 (4) (2009)
Etienne de Klerk, Dick den Hertog, G. Elabwabi
On the complexity of optimization over the standard simplex. Eur. J. Oper. Res. 191 (3) (2008)
Etienne de Klerk
The complexity of optimizing over a simplex, hypercube or sphere: a short survey. Central Eur. J. Oper. Res. 16 (2) (2008)
Etienne de Klerk, Dmitrii V. Pasechnik, Renata Sotirov
On Semidefinite Programming Relaxations of the Traveling Salesman Problem. SIAM J. Optim. 19 (4) (2008)
Etienne de Klerk, Dmitrii V. Pasechnik
A linear programming reformulation of the standard quadratic optimization problem. J. Glob. Optim. 37 (1) (2007)
Erling S. Andersen, Etienne de Klerk, Levent Tunçel, Henry Wolkowicz, Shuzhong Zhang
Foreword: Special issue on large-scale nonlinear and semidefinite programming. Math. Program. 109 (2-3) (2007)
Etienne de Klerk, Dmitrii V. Pasechnik, Alexander Schrijver
Reduction of symmetric semidefinite programs using the regular *-representation. Math. Program. 109 (2-3) (2007)
Etienne de Klerk, Dmitrii V. Pasechnik
A note on the stability number of an orthogonality graph. Eur. J. Comb. 28 (7) (2007)
Etienne de Klerk, John Maharry, Dmitrii V. Pasechnik, R. Bruce Richter, Gelasio Salazar
. SIAM J. Discret. Math. 20 (1) (2006)
Dorina Jibetean, Etienne de Klerk
Global optimization of rational functions: a semidefinite programming approach. Math. Program. 106 (1) (2006)
Etienne de Klerk, Monique Laurent, Pablo A. Parrilo
A PTAS for the minimization of polynomials of fixed degree over the simplex. Theor. Comput. Sci. 361 (2-3) (2006)
Margaréta Halická, Etienne de Klerk, Cornelis Roos
Limiting behavior of the central path in semidefinite optimization. Optim. Methods Softw. 20 (1) (2005)
Etienne de Klerk, Dmitrii V. Pasechnik, Joost P. Warners
On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the theta-Function. J. Comb. Optim. 8 (3) (2004)
Etienne de Klerk, Dmitrii V. Pasechnik
Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms. Eur. J. Oper. Res. 157 (1) (2004)
Etienne de Klerk, Hans van Maaren
On Semidefinite Programming Relaxations of (2+p)-SAT. Ann. Math. Artif. Intell. 37 (3) (2003)
Immanuel M. Bomze, Etienne de Klerk
Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive Programming. J. Glob. Optim. 24 (2) (2002)
Margaréta Halická, Etienne de Klerk, Cees Roos
On the Convergence of the Central Path in Semidefinite Optimization. SIAM J. Optim. 12 (4) (2002)
Etienne de Klerk, Dmitrii V. Pasechnik
Approximation of the Stability Number of a Graph via Copositive Programming. SIAM J. Optim. 12 (4) (2002)
Etienne de Klerk, Jiming Peng, Cees Roos, Tamás Terlaky
A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization. SIAM J. Optim. 11 (4) (2001)
Etienne de Klerk, Hans van Maaren, Joost P. Warners
Relaxations of the Satisfiability Problem Using Semidefinite Programming. J. Autom. Reason. 24 (1/2) (2000)
Immanuel M. Bomze, Mirjam Dür, Etienne de Klerk, Cornelis Roos, Arie J. Quist, Tamás Terlaky
On Copositive Programming and Standard Quadratic Optimization Problems. J. Glob. Optim. 18 (4) (2000)
Etienne de Klerk, Cornelis Roos, Tamás Terlaky
A nonconvex weighted potential function forpolynomial target following methods. Ann. Oper. Res. 81 (1998)
Etienne de Klerk, Cornelis Roos, Tamás Terlaky
Polynomial Primal-Dual Affine Scaling Algorithms in Semidefinite Programming. J. Comb. Optim. 2 (1) (1998)
Etienne de Klerk, Cornelis Roos, Tamás Terlaky, Tibor Illés, A. J. de Jong, J. Valkó, J. E. Hoogenboom
Optimization of nuclear reactor reloading patterns. Ann. Oper. Res. 69 (1997)
Etienne de Klerk, Cornelis Roos, Tamás Terlaky
Initialization in semidefinite programming via a self-dual skew-symmetric embedding. Oper. Res. Lett. 20 (5) (1997)