Etienne de Klerk

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