pith. sign in

Etienne de Klerk

Identifiers

  • name variant Etienne de Klerk 0.60 · backfill

Papers (21)

  1. Squared polynomial approximation kernels for the hypercube: improved error bounds and implications for Lasserre hierarchies math.OC · 2026 · author #2
  2. Simulated annealing with hit-and-run for convex optimization: rigorous complexity analysis and practical perspectives for copositive programming math.OC · 2019 · author #2
  3. Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere math.OC · 2019 · author #1
  4. Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization math.OC · 2018 · author #2
  5. A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis math.OC · 2018 · author #1
  6. Distributionally robust optimization with polynomial densities: theory, models and algorithms math.OC · 2018 · author #1
  7. Worst-case examples for Lasserre's measure--based hierarchy for polynomial optimization on the hypercube math.OC · 2018 · author #1
  8. Polynomial Norms math.OC · 2017 · author #2
  9. Comparison of Lasserre's measure--based bounds for polynomial optimization to bounds obtained by simulated annealing math.OC · 2017 · author #1
  10. On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions math.OC · 2016 · author #1
  11. Improved convergence rates for Lasserre-type hierarchies of upper bounds for box-constrained polynomial optimization math.OC · 2016 · author #1
  12. On the convergence rate of grid search for polynomial optimization over the simplex math.OC · 2015 · author #1
  13. Bound-constrained polynomial optimization using only elementary calculations math.OC · 2015 · author #1
  14. On the Turing model complexity of interior point methods for semidefinite programming math.OC · 2015 · author #1
  15. Convergence analysis for Lasserre's measure--based hierarchy of upper bounds for polynomial optimization math.OC · 2014 · author #1
  16. An error analysis for polynomial optimization over the simplex based on the multivariate hypergeometric distribution math.OC · 2014 · author #1
  17. An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex math.OC · 2013 · author #1
  18. Book drawings of complete bipartite graphs math.CO · 2012 · author #1
  19. Improved lower bounds on book crossing numbers of complete graphs math.CO · 2012 · author #1
  20. Improved lower bounds for the 2-page crossing numbers of K_{m,n} and K_n via semidefinite programming math.CO · 2011 · author #1
  21. On semidefinite programming relaxations of the traveling salesman problem math.OC · 2009 · author #1

Mentions

  • 1510.01163 #1 · backfill · confidence 0.70 Etienne de Klerk
  • 1507.04404 #1 · backfill · confidence 0.70 Etienne de Klerk
  • 1507.03549 #1 · backfill · confidence 0.70 Etienne de Klerk
  • 1411.6867 #1 · backfill · confidence 0.70 Etienne de Klerk
  • 2605.31496 #2 · arxiv_oai · confidence 0.70 Etienne de Klerk
  • 1407.2108 #1 · backfill · confidence 0.70 Etienne de Klerk
  • 1311.0173 #1 · backfill · confidence 0.70 Etienne de Klerk
  • 1210.2918 #1 · backfill · confidence 0.70 Etienne de Klerk
  • 1207.5701 #1 · backfill · confidence 0.70 Etienne de Klerk
  • 1110.4824 #1 · backfill · confidence 0.70 Etienne de Klerk
  • 0902.1843 #1 · backfill · confidence 0.70 Etienne de Klerk

Frequent Coauthors