Monique Laurent
 Full Name
 Prof.dr. M. Laurent
 Function(s)
 Scientific Staff Member, Professor  Universiteit Tilburg
 M.Laurent@cwi.nl
 Telephone
 +31 20 592 4105
 Room
 M233
 Department(s)
 Networks and Optimization
 Homepage
 http://homepages.cwi.nl/~monique/
Biography
Monique Laurent obtained her PhD in Mathematics at the University Paris Diderot in 1986. During her PhD studies she was a visiting researcher at New York University in the period 19841986. After two years as researcher at CNET (Paris) she became in 1988 researcher at CNRS, affiliated first with University Paris Dauphine and from 1992 with Ecole Normale Superieure. In 19901992 she visited the Institute of Discrete Mathematics in Bonn as a Humboldt Fellow. From 1997 she joined CWI as senior researcher. She was group leader of Networks and Optimizaton (N&O) between 2005 and 2016, and since 2016 she is a member of the CWI Management Team. She is also affiliated as a parttime full professor at Tilburg University since 2009.Research
Her field of research is discrete mathematics and optimization. She is in particular interested in the design of efficient algorithms for hard combinatorial problems and, more generally, polynomial optimization problems, where objective and constraints are multivariate polynomial functions. Her focus lies in understanding and exploiting combinatorial and algebraic structure in order to develop methods from algebra, geometry and optimization leading to efficient algorithms. Recent areas on which she has been working include:
 semidefinite programming based hierarchies for combinatorial graph parameters and polynomial optimization,
 noncommutative polynomial optimization approach for bounding matrix factorization ranks, and for approximating quantum graph parameters and bounding entanglement dimension in quantum information,
 convergence analysis of approximation hierarchies,
 new search algorithms for general weighted graphs, with application to the efficient recognition of structured matrices arising in combinatorial data analysis.
Publications

Slot, L.F.H, & Laurent, M. (2021). Sumofsquares hierarchies for binary polynomial optimization. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence (pp. 43–57). doi:10.1007/9783030738792_4

Slot, L.F.H, & Laurent, M. (2020). Nearoptimal analysis of Lasserre’s univariate measurebased bounds for multivariate polynomial optimization. Mathematical Programming. doi:10.1007/s1010702001586y

de Klerk, E, & Laurent, M. (2020). Worstcase Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube. Mathematics of Operations Research, 45(1). doi:10.1287/moor.2018.0983

Slot, L.F.H, & Laurent, M. (2020). Improved convergence analysis of Lasserre’s measurebased upper bounds for polynomial minimization on compact sets. Mathematical Programming, 2020. doi:10.1007/s10107020014683

de Klerk, E, & Laurent, M. (2020). Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere. Mathematical Programming, 2020. doi:10.1007/s10107019014651

de Klerk, E, & Laurent, M. (2019). A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis. In World Women in Mathematics 2018 (pp. 17–56). doi:10.1007/9783030211707_1

Gribling, S.J, de Laat, D, & Laurent, M. (2019). Lower bounds on matrix factorization ranks via noncommutative polynomial optimization. Foundations of Computational Mathematics, 1–58. doi:10.1007/s1020801809410y

de Klerk, E, & Laurent, M. (2018). Comparison of Lasserre's measurebased bounds for polynomial optimization to bounds obtained by simulated annealing. Mathematics of Operations Research, 43(4), 1317–1325. doi:10.1287/moor.2017.0906

Gribling, S.J, de Laat, D, & Laurent, M. (2018). Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization. Mathematical Programming, 170(1), 5–42. doi:10.1007/s101070181287z

Hu, H, & Laurent, M. (2018). On the linear extension complexity of stable set polytopes for perfect graphs. European Journal of Combinatorics. doi:10.1016/j.ejc.2018.02.014
Current projects with external funding

Wiskundecluster DIAMANT ()

MixedInteger NonLinear Optimisation Applications (MINOA)

Optimization for and with Machine Learning (OPTIMAL)

Polynomial Optimization, Efficiency through Moments and Algebra (POEMA)
Professional activities
 Editor: SIAM Journal on Discrete Mathematics (SIDMA)
 Editor: Journal: Mathematical Programming Series A
 Board Member: scientific committee, MFO Oberwolfach
 Nominated: SIAM Fellow (class 2017)
 Editor: SIAM Journal on Mathematics of Data Science (SIMODS)
 Nominated: KNAW member (2018)
 Editor: Indagationes Mathematicae (from 2019)
 Nominated: KHMW member (2019)
Grants
 EU Marie Curie Initial Training Network (ITN), Polynomial Optimization, Efficiency through Moments and Algebra (POEMA) (2019)
 EU Marie Curie Initial Training Network (ITN), Mixed Integer Nonlinear Optimization Applications (MINOA) (2018)
 NWO TOP grant (Compartiment 1) Approximation Algorithms, Quantum Information and Semidefinite Optimization (2013)
 EU Marie Curie  EU Marie Curie Initial Training Network (ITN), Mixed Integer Nonlinear Optimization (MINO) (2012)
 Vidi Innovational Research Grant NWO  NWO639032203, 20032008 (2003)