We are Tilburg University

We are Tilburg University

Bio

Etienne de Klerk held assistant professorships at the TU Delft from 1998 to 2003, and from 2003 to 2005 an associate professorship at the University of Waterloo, Canada. In 2004 he was appointed at Tilburg University, first as associate professor, and then as full professor (2009). From August 2012 to August 2013, he was also appointed as full professor at the Nanyang Technological University in Singapore. As of September 1st, 2015, he also holds a part-time professorship at the TU Delft. He is associate editor of the SIAM Journal on Optimization, and has served two terms as associate editor of the INFORMS Journal Operations Research. He is co-recipient of the Canadian Foundation for Innovation’s New Opportunities Fund award, and a recipient of the VIDI grant of the NWO. He received the 2017 Best Paper Prize from Optimization Letters for joint work on the complexity of gradient descent methods.

Courses

Recent publications

  1. Polynomial norms

    Ahmadi, A., de Klerk, E., & Hall, G. (2019). Polynomial norms. SIAM Journal on Optimization, 29(1), 399–422.
  2. A survey of semidefinite programming approaches to the generalized pr…

    de Klerk, E., & Laurent, M. (Accepted/In press). A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis. In World Women in Mathematics 2018 (Association for Women in Mathematics Series ; Vol. 20). Rio de Janeiro: Springer.
  3. Comparison of Lasserre's measure-based bounds for polynomial optimiza…

    de Klerk, E., & Laurent, M. (2018). Comparison of Lasserre's measure-based bounds for polynomial optimization to bounds obtained by simulated annealing. Mathematics of Operations Research, 43(4), 1317-1325.
  4. A numerical evaluation of the bounded degree sum-of-squares hierarchy…

    Marandi, A., Dahl, J., & de Klerk, E. (2018). A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem. Annals of Operations Research, 265(1), 67-92.
  5. Solving sparse polynomial optimization problems with chordal structur…

    de Klerk, E., Marandi, A., & Dahl, J. (2018). Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy. Discrete Applied Mathematics.

Find an expert or expertise