Monique Laurent
Computational Theory and Mathematics · 2003–2012
A researcher in the Science corpus: 6 papers; trusts 27 researchers and is trusted by 41 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 47 citations into it; #1,318 of 12,182 by trust here, #2,761 by citations
- Numerical Analysis — 42 citations into it; #354 of 3,586 by trust here, #547 by citations
- Control and Systems Engineering — 12 citations into it
- Applied Mathematics — 11 citations into it; #3,869 of 7,620 by trust here, #6,241 by citations
- Computational Mechanics — 7 citations into it
- Algebra and Number Theory — 6 citations into it; #1,335 of 2,864 by trust here, #2,247 by citations
- Geometry and Topology — 5 citations into it
Whom Monique Laurent trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Pablo A. Parrilo
- Jean B. Lasserre
- Didier Henrion
- Yurii E. Nesterov
- Dinesh Manocha
- Victoria Powers
- R. Curto
- Tim Netzer
- Bruce Reznick
- David Grimm
Who trusts Monique Laurent overall
- Martin J. Wainwright
- R. Curto
- L. Fialkow
- Clark W. Barrett
- Antonio Acín
- Jean B. Lasserre
- Michael I. Jordan
- Jiawang Nie
- Thomas Zaslavsky
- Margret Keuper
Papers from Monique Laurent's perspective
Ordered by how strongly the researchers Monique Laurent trusts endorse each paper. Same corpus, a different order for every researcher.
- Global Optimization with Polynomials and the Problem of Moments (SIAM Journal on Optimization)
- The truncated complex -moment problem
- GloptiPoly: global optimization over polynomials with Matlab and SeDuMi (Proceedings of the 41st IEEE Conference on Decision and Control, 2002.)
- Distinguished representations of strictly positive polynomials
- Semidefinite programming relaxations for semialgebraic problems
- SOLVING SYSTEMS OF POLYNOMIAL EQUATIONS
- Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization
- Some NP-complete problems in quadratic and nonlinear programming
- A new bound for Pólya's Theorem with applications to polynomials positive on polyhedra
- Minimizing Polynomial Functions (Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science)
Their papers
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0-1 Programming (2003) — 471 citations
- Sums of Squares, Moment Matrices and Optimization Over Polynomials (2009) — 943 citations
- A generalized flat extension theorem for moment matrices (2009) — 55 citations
- SIAM Journal on Optimization (2012) — 143 citations
- Geometry of cuts and metrics (2009) — 1,146 citations
- Revisiting two theorems of Curto and Fialkow on moment matrices (2005) — 101 citations