2018 - Royal Netherlands Academy of Arts and Sciences
2017 - SIAM Fellow For contributions to discrete and polynomial optimization and revealing interactions between them.
Discrete mathematics, Combinatorics, Semidefinite programming, Positive-definite matrix and Polynomial are her primary areas of study. Her Discrete mathematics research integrates issues from Quantum Fourier transform, Quantum algorithm, Controlled NOT gate, Algebraic number and Regular polygon. Her work focuses on many connections between Combinatorics and other disciplines, such as Moment matrix, that overlap with her field of interest in Monomial.
Her Semidefinite programming study integrates concerns from other disciplines, such as Combinatorial optimization, Approximation algorithm, Conic optimization and Semidefinite embedding. Monique Laurent has included themes like Structure and Diagonal in her Positive-definite matrix study. She has researched Polytope in several fields, including Birkhoff polytope and Complete graph.
Her scientific interests lie mostly in Combinatorics, Discrete mathematics, Semidefinite programming, Polytope and Positive-definite matrix. Her study in Combinatorics is interdisciplinary in nature, drawing from both Matrix, Symmetric matrix and Polynomial. Her System of polynomial equations study in the realm of Polynomial interacts with subjects such as Rate of convergence.
Her study in the field of Time complexity, Independent set and Maximum cut also crosses realms of Hierarchy. Her Semidefinite programming research includes themes of Semidefinite embedding, Quadratically constrained quadratic program, Approximation algorithm and Positive polynomial. Her biological study spans a wide range of topics, including Delaunay triangulation, Complete graph, Dimension, Cone and Convex hull.
Her primary areas of investigation include Combinatorics, Discrete mathematics, Rate of convergence, Measure and Polynomial. The various areas that Monique Laurent examines in her Combinatorics study include Positive-definite matrix, Matrix, Symmetric matrix, Monotone polygon and Upper and lower bounds. Her Positive-definite matrix study incorporates themes from Conic optimization, Noncommutative geometry, Semidefinite programming, Rank and Matrix decomposition.
Her Discrete mathematics research incorporates elements of Symmetry and Quantum entanglement. Monique Laurent combines subjects such as Hypercube, Convex body and Orthogonal polynomials with her study of Measure. The concepts of her Polynomial study are interwoven with issues in Simplex, Closed set and Hierarchy.
Monique Laurent mainly focuses on Combinatorics, Discrete mathematics, Rate of convergence, Hypercube and Measure. Her research integrates issues of Matrix, Upper and lower bounds and Polynomial in her study of Combinatorics. Her Discrete mathematics study combines topics in areas such as Monotone polygon, Symmetric matrix and Semidefinite programming.
The Semidefinite programming study combines topics in areas such as Quantum discord, Quantum correlation, Quantum graph and Conic section. In her research on the topic of Hypercube, Borel measure is strongly related with Lebesgue measure. Her studies in Measure integrate themes in fields like Compact space and Convex body.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Geometry of Cuts and Metrics
Michel Marie Deza;Monique Laurent.
Sums of Squares, Moment Matrices and Optimization Over Polynomials
The IMA Volumes in Mathematics and its Applications Series (2009)
A comparison of the Sherali-Adams, Lov\\341sz-Schrijver and Lasserre relaxations for 0-1 programming
Mathematics of Operations Research (2001)
Semidefinite programming and integer programming
Monique Laurent;Franz Rendl.
Handbooks in Operations Research and Management Science (2005)
Matrix Completion Problems.
Encyclopedia of Optimization (2009)
On a positive semidefinite relaxation of the cut polytope
Monique Laurent;Svatopluk Poljak.
Linear Algebra and its Applications (1995)
Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals
Jean Bernard Lasserre;Monique Laurent;Philipp Rostalski.
Foundations of Computational Mathematics (2008)
Facets for the cut cone I
Michel Deza;Monique Laurent.
Mathematical Programming (1992)
A PTAS for the minimization of polynomials of fixed degree over the simplex
Etienne de Klerk;Monique Laurent;Pablo A. Parrilo.
workshop on approximation and online algorithms (2006)
Semidefinite representations for finite varieties
Mathematical Programming (2007)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: