We are Tilburg University

We are Tilburg University

Bio

Here is a brief introduction about my career path. I (Monique Laurent) obtained my PhD in Mathematics at the University Paris Diderot in 1986. During my PhD studies I was a visiting researcher at New York University in the period 1984-1986. After two years as researcher at CNET (Paris) I became in 1988 researcher at CNRS, affiliated  from 1992 with Ecole Normale Superieure. In 1990-1992 I visited the Institute of Discrete Mathematics in Bonn as a Humboldt Fellow. In 1997 I joined CWI as senior researcher. I am affiliated as a part-time full professor in the Department of Operations Research and Econometrics of Tilburg University since 2009.

My field of research is discrete mathematics and optimization. My focus is in developing algebraic, combinatorial and geometric methods for the design of efficient algorithm for hard combinatorial optimization and polynomial optimization problems, with a recent interest in applications to quantum information theory.

Recent publications

  1. 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.
  2. 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.
  3. Bounds on entanglement dimensions and quantum graph parameters via no…

    Gribling, S., de Laat, D., & Laurent, M. (2018). Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization. Mathematical Programming , 170(1), 5-42.
  4. Worst-case examples for Lasserre's measure-based hierarchy for polyno…

    de Klerk, E., & Laurent, M. (Accepted/In press). Worst-case examples for Lasserre's measure-based hierarchy for polynomial optimization on the hypercube. Mathematics of Operations Research.
  5. Perfect elimination orderings for symmetric matrices

    Laurent, M., & Tanigawa, S. (2017). Perfect elimination orderings for symmetric matrices. Optimization Letters.

Find an expert or expertise