Bio

I (Monique Laurent) received my PhD in Mathematics at U. Paris Diderot in 1986. After working two years at CNET (Paris) I became in 1988 researcher at CNRS, affiliated with ENS Paris from 1992. I was a Humboldt Fellow at Bonn Institute of Discrete Mathematics in 1990-92. In 1997 I joined Centrum Wiskunde & Informatica (CWI) in Amsterdam as senior researcher and in 2009 became a part-time full professor in Tilburg. I serve on the editorial boards of SIAM J. on Optimization (2001-2015), SIAM J. Discrete Mathematics (2007-2019), Mathematics of Operations Research (2001-2013), SIAM J. Mathematics of Data Sciences (2018--), and Mathematical Programming (2012--). I became a SIAM Fellow in 2017 and was elected a member of the Royal Netherlands Academy of Arts and Sciences (KNAW) in 2018 and of the Royal Holland Society of Sciences and Humanities (KHMW) in 2019. I am currently co-recipient of an ENW-Groot grant from NWO.

Expertise

My field of research is in discrete mathematics and optimization,  with focus on algebraic, combinatorial and geometric methods for the design and analysis of algorithms for combinatorial and polynomial optimization problems.  For details please see my personal homepage (with CV).

Recent publications

  1. Convergence analysis of a Lasserre hierarchy of upper bounds for poly…

    de Klerk, E., & Laurent, M. (2022). Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere. Mathematical Programming , 193(2), 665-685.
  2. Bounding the separable rank via polynomial optimization

    Gribling, S., Laurent, M., & Steenkamp, A. (2022). Bounding the separable rank via polynomial optimization. Linear Algebra and its Applications, 648, 1-55.
  3. Exactness of Parrilo's conic approximations for copositive matrices >…

    Laurent, M., & Vargas, L. (Accepted/In press). Exactness of Parrilo's conic approximations for copositive matrices >> and associated low order bounds for the stability number of a graph. Mathematics of Operations Research. https://arxiv.org/abs/2109.12876
  4. Finite convergence of sum-of-squares hierarchies for the stability nu…

    Laurent, M., & Vargas, L. F. (2022). Finite convergence of sum-of-squares hierarchies for the stability number of a graph. SIAM Journal on Optimization, 32(2), 491-518.
  5. Improved convergence analysis of Lasserre's measure-based upper bound…

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

Find an expert or expertise