Optimization of nuclear reactor reloading patterns. - Etienne de Klerk; Cornelis Roos; Tamás Terlaky; Tibor Illés; A. J. de Jong; J. Valkó; J. E. Hoogenboom (Ann. Oper. Res., 1997)

Initialization in semidefinite programming via a self-dual skew-symmetric embedding. - Etienne de Klerk; Cornelis Roos; Tamás Terlaky (Oper. Res. Lett., 1997)

A nonconvex weighted potential function forpolynomial target following methods. - Etienne de Klerk; Cornelis Roos; Tamás Terlaky (Ann. Oper. Res., 1998)

Polynomial Primal-Dual Affine Scaling Algorithms in Semidefinite Programming. - Etienne de Klerk; Cornelis Roos; Tamás Terlaky (J. Comb. Optim., 1998)

Relaxations of the Satisfiability Problem Using Semidefinite Programming. - Etienne de Klerk; Hans van Maaren; Joost P. Warners (J. Autom. Reason., 2000)

On Copositive Programming and Standard Quadratic Optimization Problems. - Immanuel M. Bomze; Mirjam Dür; Etienne de Klerk; Cornelis Roos; Arie J. Quist; Tamás Terlaky (J. Glob. Optim., 2000)

A Scaled Gauss–Newton Primal-Dual Search Direction for Semidefinite Optimization. - Etienne de Klerk; Jiming Peng; Cees Roos; Tamás Terlaky (SIAM J. Optim., 2001)

Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive Programming. - Immanuel M. Bomze; Etienne de Klerk (J. Glob. Optim., 2002)

On the Convergence of the Central Path in Semidefinite Optimization. - Margaréta Halická; Etienne de Klerk; Cees Roos (SIAM J. Optim., 2002)

Approximation of the Stability Number of a Graph via Copositive Programming. - Etienne de Klerk; Dmitrii V. Pasechnik (SIAM J. Optim., 2002)

On Semidefinite Programming Relaxations of (2+p)-SAT. - Etienne de Klerk; Hans van Maaren (Ann. Math. Artif. Intell., 2003)

Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms. - Etienne de Klerk; Dmitrii V. Pasechnik (Eur. J. Oper. Res., 2004)

On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the theta-Function. - Etienne de Klerk; Dmitrii V. Pasechnik; Joost P. Warners (J. Comb. Optim., 2004)

Limiting behavior of the central path in semidefinite optimization. - Margaréta Halická; Etienne de Klerk; Cornelis Roos (Optim. Methods Softw., 2005)

Global optimization of rational functions: a semidefinite programming approach. - Dorina Jibetean; Etienne de Klerk (Math. Program., 2006)

Improved Bounds for the Crossing Numbers of Km, n and Kn. - Etienne de Klerk; John Maharry; Dmitrii V. Pasechnik; R. Bruce Richter; Gelasio Salazar (SIAM J. Discret. Math., 2006)

A PTAS for the minimization of polynomials of fixed degree over the simplex. - Etienne de Klerk; Monique Laurent; Pablo A. Parrilo (Theor. Comput. Sci., 2006)

A note on the stability number of an orthogonality graph. - Etienne de Klerk; Dmitrii V. Pasechnik (Eur. J. Comb., 2007)

A linear programming reformulation of the standard quadratic optimization problem. - Etienne de Klerk; Dmitrii V. Pasechnik (J. Glob. Optim., 2007)

Foreword: Special issue on large-scale nonlinear and semidefinite programming. - Erling S. Andersen; Etienne de Klerk; Levent Tunçel; Henry Wolkowicz; Shuzhong Zhang (Math. Program., 2007)

Reduction of symmetric semidefinite programs using the regular *-representation. - Etienne de Klerk; Dmitrii V. Pasechnik; Alexander Schrijver (Math. Program., 2007)

The complexity of optimizing over a simplex, hypercube or sphere: a short survey. - Etienne de Klerk (Central Eur. J. Oper. Res., 2008)

On the complexity of optimization over the standard simplex. - Etienne de Klerk; Dick den Hertog; G. Elabwabi (Eur. J. Oper. Res., 2008)

On Semidefinite Programming Relaxations of the Traveling Salesman Problem. - Etienne de Klerk; Dmitrii V. Pasechnik; Renata Sotirov (SIAM J. Optim., 2008)

On the Lovász theta-number of almost regular graphs with application to Erdos-Rényi graphs. - Etienne de Klerk; Michael W. Newman; Dmitrii V. Pasechnik; Renata Sotirov (Eur. J. Comb., 2009)

A new library of structured semidefinite programming instances. - Etienne de Klerk; Renata Sotirov (Optim. Methods Softw., 2009)

Erratum: On Semidefinite Programming Relaxations of the Traveling Salesman Problem. - Etienne de Klerk; Dmitrii V. Pasechnik; Renata Sotirov (SIAM J. Optim., 2009)

Exploiting special structure in semidefinite programming: A survey of theory and applications. - Etienne de Klerk (Eur. J. Oper. Res., 2010)

Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem. - Etienne de Klerk; Renata Sotirov (Math. Program., 2010)

Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster. - Ivan D. Ivanov; Etienne de Klerk (Optim. Methods Softw., 2010)

Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube. - Etienne de Klerk; Monique Laurent (SIAM J. Optim., 2010)

A comparison of lower bounds for the symmetric circulant traveling salesman problem. - Etienne de Klerk; Cristian Dobre (Discret. Appl. Math., 2011)

Preface. - Miguel F. Anjos; Etienne de Klerk; Franz Rendl (Math. Program., 2011)

Numerical block diagonalization of matrix *-algebras with application to semidefinite programming. - Etienne de Klerk; Cristian Dobre; Dmitrii V. Pasechnik (Math. Program., 2011)

On the complexity of computing the handicap of a sufficient matrix. - Etienne de Klerk; Marianna E.-Nagy (Math. Program., 2011)

On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems. - Etienne de Klerk; Monique Laurent (SIAM J. Optim., 2011)

On semidefinite programming relaxations of maximum $$k$$ -section. - Etienne de Klerk; Dmitrii V. Pasechnik; Renata Sotirov; Cristian Dobre (Math. Program., 2012)

Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry. - Etienne de Klerk; Renata Sotirov (Math. Program., 2012)

Improved Lower Bounds for the 2-Page Crossing Numbers of Km, n and Kn via Semidefinite Programming. - Etienne de Klerk; Dmitrii V. Pasechnik (SIAM J. Optim., 2012)

On semidefinite programming bounds for graph bandwidth. - Etienne de Klerk; Marianna E.-Nagy; Renata Sotirov (Optim. Methods Softw., 2013)

Special issue in honour of Professor Kees Roos' 70th Birthday. - Tamás Terlaky; Etienne de Klerk; Goran Lesaja; Dick den Hertog (Optim. Methods Softw., 2013)

Improved Lower Bounds on Book Crossing Numbers of Complete Graphs. - Etienne de Klerk; Dmitrii V. Pasechnik; Gelasio Salazar (SIAM J. Discret. Math., 2013)

Book drawings of complete bipartite graphs. - Etienne de Klerk; Dmitrii V. Pasechnik; Gelasio Salazar (Discret. Appl. Math., 2014)

Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems. - Etienne de Klerk; Marianna E.-Nagy; Renata Sotirov; Uwe Truetsch (Eur. J. Oper. Res., 2014)

A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives. - Etienne de Klerk; Renata Sotirov; Uwe Truetsch (INFORMS J. Comput., 2015)

An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex. - Etienne de Klerk; Monique Laurent; Zhao Sun (Math. Program., 2015)

An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution. - Etienne de Klerk; Monique Laurent; Zhao Sun (SIAM J. Optim., 2015)

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

On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming. - Etienne de Klerk; Frank Vallentin (SIAM J. Optim., 2016)

Bound-Constrained Polynomial Optimization Using Only Elementary Calculations. - Etienne de Klerk; Jean B. Lasserre; Monique Laurent; Zhao Sun (Math. Oper. Res., 2017)

Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization. - Etienne de Klerk; Monique Laurent; Zhao Sun (Math. Program., 2017)

On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions. - Etienne de Klerk; François Glineur; Adrien B. Taylor (Optim. Lett., 2017)

On the convergence rate of grid search for polynomial optimization over the simplex. - Etienne de Klerk; Monique Laurent; Zhao Sun; Juan C. Vera 001 (Optim. Lett., 2017)

Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization. - Etienne de Klerk; Roxana Hess; Monique Laurent (SIAM J. Optim., 2017)

A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem. - Ahmadreza Marandi; Joachim Dahl; Etienne de Klerk (Ann. Oper. Res., 2018)

Comparison of Lasserre's Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing. - Etienne de Klerk; Monique Laurent (Math. Oper. Res., 2018)

Polynomial Norms. - Amir Ali Ahmadi; Etienne de Klerk; Georgina Hall (SIAM J. Optim., 2019)

Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy. - Ahmadreza Marandi; Etienne de Klerk; Joachim Dahl (Discret. Appl. Math., 2020)

Worst-Case Examples for Lasserre's Measure-Based Hierarchy for Polynomial Optimization on the Hypercube. - Etienne de Klerk; Monique Laurent (Math. Oper. Res., 2020)

Distributionally robust optimization with polynomial densities: theory, models and algorithms. - Etienne de Klerk; Daniel Kuhn 001; Krzysztof Postek (Math. Program., 2020)

Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation. - Etienne de Klerk; François Glineur; Adrien B. Taylor (SIAM J. Optim., 2020)

Minimum energy configurations on a toric lattice as a quadratic assignment problem. - Daniel Brosch; Etienne de Klerk (Discret. Optim., 2022)

An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix. - Riley Badenbroek; Etienne de Klerk (INFORMS J. Comput., 2022)

Simulated Annealing for Convex Optimization: Rigorous Complexity Analysis and Practical Perspectives. - Riley Badenbroek; Etienne de Klerk (J. Optim. Theory Appl., 2022)

Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization. - Riley Badenbroek; Etienne de Klerk (Math. Oper. Res., 2022)

Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere. - Etienne de Klerk; Monique Laurent (Math. Program., 2022)

The exact worst-case convergence rate of the gradient method with fixed step lengths for L-smooth functions. - Hadi Abbaszadehpeivasti; Etienne de Klerk; Moslem Zamani (Optim. Lett., 2022)

Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere. - Felix Kirschner; Etienne de Klerk (Optim. Lett., 2022)

Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software. - Daniel Brosch; Etienne de Klerk (Optim. Methods Softw., 2022)

Revisiting Semidefinite Programming Approaches to Options Pricing: Complexity and Computational Perspectives. - Didier Henrion; Felix Kirschner; Etienne de Klerk; Milan Korda; Jean-Bernard Lasserre; Victor Magron (INFORMS J. Comput., 2023)

Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming. - Felix Kirschner; Etienne de Klerk (SIAM J. Optim., 2023)

Conditions for linear convergence of the gradient method for non-convex optimization. - Hadi Abbaszadehpeivasti; Etienne de Klerk; Moslem Zamani (Optim. Lett., 2023)

Convergence rate analysis of the gradient descent-ascent method for convex-concave saddle-point problems. - Moslem Zamani; Hadi Abbaszadehpeivasti; Etienne de Klerk (Optim. Methods Softw., 2024)

On the Rate of Convergence of the Difference-of-Convex Algorithm (DCA). - Hadi Abbaszadehpeivasti; Etienne de Klerk; Moslem Zamani (J. Optim. Theory Appl., 2024)

Conic Optimization and Interior Point Methods: Theory, Computations, and Applications. - Tibor Illés; Florian Jarre; Etienne de Klerk; Goran Lesaja (J. Optim. Theory Appl., 2024)

The exact worst-case convergence rate of the alternating direction method of multipliers. - Moslem Zamani; Hadi Abbaszadehpeivasti; Etienne de Klerk (Math. Program., 2024)

Optimization-aided construction of multivariate Chebyshev polynomials. - Mareike Dressler; Simon Foucart; Mioara Joldes; Etienne de Klerk; Jean B. Lasserre; Yuan Xu (J. Approx. Theory, 2025)