Etienne de Klerk
Orcid: 0000-0003-3377-0063
According to our database1,
Etienne de Klerk
authored at least 71 papers
between 1997 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2023
Conditions for linear convergence of the gradient method for non-convex optimization.
Optim. Lett., June, 2023
Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming.
SIAM J. Optim., 2023
2022
Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software.
Optim. Methods Softw., 2022
Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere.
Optim. Lett., 2022
The exact worst-case convergence rate of the gradient method with fixed step lengths for L-smooth functions.
Optim. Lett., 2022
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere.
Math. Program., 2022
Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization.
Math. Oper. Res., 2022
Simulated Annealing for Convex Optimization: Rigorous Complexity Analysis and Practical Perspectives.
J. Optim. Theory Appl., 2022
An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix.
INFORMS J. Comput., 2022
Discret. Optim., 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
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
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
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
2013
SIAM J. Discret. Math., 2013
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
Math. Program., 2012
2011
On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems.
SIAM J. Optim., 2011
Math. Program., 2011
Numerical block diagonalization of matrix *-algebras with application to semidefinite programming.
Math. Program., 2011
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
SIAM J. Optim., 2009
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
SIAM J. Optim., 2008
Eur. J. Oper. Res., 2008
Central Eur. J. Oper. Res., 2008
2007
Math. Program., 2007
Math. Program., 2007
J. Glob. Optim., 2007
2006
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
Math. Program., 2006
2005
Optim. Methods Softw., 2005
2004
J. Comb. Optim., 2004
Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms.
Eur. J. Oper. Res., 2004
2003
Ann. Math. Artif. Intell., 2003
2002
SIAM J. Optim., 2002
SIAM J. Optim., 2002
Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive Programming.
J. Glob. Optim., 2002
2001
SIAM J. Optim., 2001
2000
J. Glob. Optim., 2000
J. Autom. Reason., 2000
1998
J. Comb. Optim., 1998
Ann. Oper. Res., 1998
1997
Oper. Res. Lett., 1997