Research Output per year
Personal profile
Research interests
My field of expertise is combinatorial optimization. In the recent years I am in particular interested in the use of semidefinite programming to design efficient approximations for hard combinatorial problems (graph coloring, max-cut, etc.) and, more generally, for polynomial optimization problems, where objective and constraints are polynomial functions and algorithms can be developed using algebraic techniques.
For further information, please refer to my webpage at CWI
Career
1985 to 1986: Guest researcher at New York University
1986 to 1988: Research engineer at CNET (Centre National d'Etudes des Telecommunications, Paris, France)
1988 to 1997: Researcher at CNRS (Paris, France), with affiliation with Universite Paris Dauphine between 1988-1992 and at Ecole Normale Superieure between 1992-1997
August 1990 to February 1992: Research fellow of the Von Humboldt Foundation at the Institute of Discrete Mathematics and Operations Research in Bonn, Germany
From 1997: Researcher at Centrum Wiskunde & Informatica (CWI), Amsterdam
From 2005: Leader of the research group Algorithms, Combinatorics and Optimization at CWI
From September 2009: Part-time full professor at the Department of Econometrics and Operations Research, Tilburg School of Economics and Management
Current courses
Click here for my courses.
External positions
(Centrum Wiskunde & Informatica (CWI))
1 Sep 1997 → …Keywords
- Operations Research
- Optimisation
- Combinatorics
- Mathematics
Fingerprint Dive into the research topics where Monique Laurent is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 5 Similar Profiles
Network
Recent external collaboration on country level. Dive into details by clicking on the dots.
Research Output
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere
de Klerk, E. & Laurent, M., Jan 2020, In : Mathematical Programming .Research output: Contribution to journal › Article › Scientific › peer-review
Open Access
Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets
Slot, L. & Laurent, M., Jan 2020, (Accepted/In press) In : Mathematical Programming .Research output: Contribution to journal › Article › Scientific › peer-review
Worst-case examples for Lasserre's measure-based hierarchy for polynomial optimization on the hypercube
de Klerk, E. & Laurent, M., 2020, In : Mathematics of Operations Research. 45, 1, p. 86-98Research output: Contribution to journal › Article › Scientific › peer-review
Open Access
File
A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis
de Klerk, E. & Laurent, M., Dec 2019, World Women in Mathematics 2018: Proceedings of the First World Meeting for Women in Mathematics (WM)². Araujo, C., Benkart, G., Praeger, C. E. & Tanbay, B. (eds.). Cham: Springer, p. 17-56 (Association for Women in Mathematics Series ; vol. 20).Research output: Chapter in Book/Report/Conference proceeding › Chapter › Scientific › peer-review
Open Access
File
Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
Gribling, S., De Laat, D. & Laurent, M., Oct 2019, In : Foundations of Computational Mathematics. 19, 5, p. 1013-1070Research output: Contribution to journal › Article › Scientific › peer-review
Open Access