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. Optimizing hypergraph-based polynomials modeling job-occupancy in que…

    Brosch, D., Laurent, M., & Steenkamp, A. (Accepted/In press). Optimizing hypergraph-based polynomials modeling job-occupancy in queueing with redundancy scheduling. SIAM Journal on Optimization. https://arxiv.org/abs/2009.04510
  2. Convergence analysis of a Lasserre hierarchy of upper bounds for poly…

    de Klerk, E., & Laurent, M. (2020). Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere. Mathematical Programming .
  3. Worst-case examples for Lasserre's measure-based hierarchy for polyno…

    de Klerk, E., & Laurent, M. (2020). Worst-case examples for Lasserre's measure-based hierarchy for polynomial optimization on the hypercube. Mathematics of Operations Research, 45(1), 86-98.
  4. Perfect elimination orderings for symmetric matrices

    Laurent, M., & Tanigawa, S. (2020). Perfect elimination orderings for symmetric matrices. Optimization Letters, 14(2), 339-353.
  5. Improved convergence analysis of Lasserre's measure-based upper bound…

    Slot, L., & Laurent, M. (2020). Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets. Mathematical Programming .

Find an expert or expertise