Jean B. Lasserre
Computational Theory and Mathematics · 2000–2019
A researcher in the Science corpus: 18 papers; trusts 37 researchers and is trusted by 104 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 58 citations into it; #141 of 12,489 by trust here, #570 by citations
- Numerical Analysis — 47 citations into it; #48 of 3,703 by trust here, #110 by citations
- Applied Mathematics — 24 citations into it
- Control and Systems Engineering — 11 citations into it; #137 of 8,519 by trust here, #570 by citations
- Artificial Intelligence — 10 citations into it
- Computational Mechanics — 9 citations into it; #2,981 of 10,021 by trust here, #5,365 by citations
- Statistics and Probability — 8 citations into it; #8,636 of 13,188 by trust here, #11,113 by citations
- Algebra and Number Theory — 7 citations into it
Whom Jean B. Lasserre trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- T. Jacobi
- R. Curto
- Pablo A. Parrilo
- Dimitris J. Bertsimas
- L. Fialkow
- Didier Henrion
- Yurii E. Nesterov
- Roger Fletcher
- Christoph Helmberg
- Wendell H. Fleming
Who trusts Jean B. Lasserre overall
- Didier Henrion
- Monique Laurent
- Jiawang Nie
- Claus Scheiderer
- Masakazu Kojima
- Ricardo C. L. F. Oliveira
- Dimitris J. Bertsimas
- Cédric Josz
- Steven H. Low
- R. Curto
Papers from Jean B. Lasserre's perspective
Ordered by how strongly the researchers Jean B. Lasserre 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
- Semidefinite programming
- Distinguished representations of strictly positive polynomials
- Practical Methods of Optimization: Fletcher/Practical Methods of Optimization
- SOLVING SYSTEMS OF POLYNOMIAL EQUATIONS
- On Cones of Nonnegative Quadratic Functions (Mathematics of Operations Research)
- Some NP-complete problems in quadratic and nonlinear programming
- Practical optimization
- Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization
Their papers
- Global Optimization with Polynomials and the Problem of Moments (2000) — 2,867 citations
- An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs (2001) — 306 citations
- Moments, Positive Polynomials And Their Applications (2009) — 1,158 citations
- Polynomials nonnegative on a grid and discrete optimization (2001) — 57 citations
- Detecting global optimality and extracting solutions in GloptiPoly (2003) — 346 citations
- Bounds on measures satisfying moment conditions (2002) — 72 citations
- GloptiPoly 3: moments, optimization and semidefinite programming (2007) — 612 citations
- SOS approximations of nonnegative polynomials via simple high degree perturbations (2005) — 80 citations
- Semi-algebraic Approximation Using Christoffel–Darboux Kernel (2019) — 28 citations
- Numerical integration of homogeneous functions on convex and nonconvex polygons and polyhedra (2015) — 98 citations
- An Introduction to Polynomial and Semi-Algebraic Optimization (2015) — 352 citations
- SIAM Journal on Optimization (2012) — 143 citations
- Handbook on Semidefinite, Conic and Polynomial Optimization (2012) — 481 citations
- Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations (2007) — 322 citations
- PRICING A CLASS OF EXOTIC OPTIONS VIA MOMENTS AND SDP RELAXATIONS (2006) — 74 citations
- Markov chains and invariant probabilities (2003) — 232 citations
- GloptiPoly: global optimization over polynomials with Matlab and SeDuMi (2002) — 448 citations
- On the importance of sequencing decisions in production planning and scheduling (2002) — 65 citations