2026 Jean B. Lasserre: Mathematics Researcher – H-Index, Publications & Awards

D-Index & Metrics

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	62	2857	2773	43	42	384	19087
Mathematics	62	466	389	22	19	434	19366

Discipline name

D-Index

World Ranking

Current World Ranking

National Ranking

Current National Ranking

Publications

Citations

Computer Science

2857

2773

384

19087

Mathematics

466

389

434

19366

Computer Science

D-Index

Citations

19087

World Ranking

2857

National Ranking

Mathematics

D-Index

Citations

19366

World Ranking

466

National Ranking

Research.com Recognitions

2025 - Research.com Computer Science in France Leader Award
2022 - Research.com Computer Science in France Leader Award
2015 - INFORMS John von Neumann Theory Prize
2015 - Khachiyan Prize of the INFORMS Optimization Society
2014 - SIAM Fellow For contributions to global polynomial optimization and the generalized problem of moments.

Overview

Jean B. Lasserre is affiliated with the Laboratory for Analysis and Architecture of Systems in France. Their research predominantly spans the fields of Mathematics and Computer Science, with substantial contributions to Numerical Analysis, Computational Theory and Mathematics, Applied Mathematics, Computational Mechanics, and Control and Systems Engineering.

Their main topics of work include:

Advanced Optimization Algorithms Research
Polynomial and Algebraic Computation
Matrix Theory and Algorithms
Probabilistic and Robust Engineering Design
Mathematical Functions and Polynomials
Advanced Numerical Analysis Techniques
Markov Chains and Monte Carlo Methods

Recent papers authored or co-authored by Lasserre cover both theoretical and applied aspects of optimization and data analysis:

"TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity," 2021, SIAM Journal on Optimization
"Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension," 2021, SIAM Journal on Optimization
"CS-TSSOS: Correlative and Term Sparsity for Large-Scale Polynomial Optimization," 2022, ACM Transactions on Mathematical Software
"Stranded in the high tide line: Spatial and temporal variability of beached microplastics in a semi-enclosed embayment (Arcachon, France)," 2021, The Science of The Total Environment
"The Christoffel-Darboux Kernel for Data Analysis," 2022, Cambridge University Press eBooks

Lasserre's collaborative work includes frequent cooperation with researchers such as Victor Magron, Didier Henrion, Mihai Putinar, and Edouard Pauwels.

The scientist has published extensively in several journals and venues, with the highest number of publications appearing in arXiv (Cornell University), followed by Comptes Rendus Mathématique, Mathematical Programming, SIAM Journal on Optimization, and Optimization Letters.

In addition to journal publications, Lasserre has authored books, including the title "The Moment-SOS Hierarchy," published by Imperial College Press in 2020.

Lasserre's professional recognitions include:

INFORMS John von Neumann Theory Prize, 2015
Khachiyan Prize of the INFORMS Optimization Society, 2015
SIAM Fellow, 2014, for contributions to global polynomial optimization and the generalized problem of moments

Best Publications

Global Optimization with Polynomials and the Problem of Moments

Jean B. Lasserre

3099
Citations
Discrete-time Markov control processes

Onésimo Hernández-Lerma;Jean Bernard Lasserre

1434
Citations
Moments, Positive Polynomials And Their Applications

Jean Bernard Lasserre

1318
Citations
Further Topics on Discrete-Time Markov Control Processes

Onésimo Hernández-Lerma;Jean Bernard Lasserre

692
Citations
GloptiPoly 3: moments, optimization and semidefinite programming

Didier Henrion;Jean-Bernard Lasserre;Johan Lofberg

657
Citations
GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi

Didier Henrion;Jean-Bernard Lasserre

539
Citations
Handbook on semidefinite, conic and polynomial optimization

Miguel F. Anjos;Jean-Bernard Lasserre

398
Citations
Detecting global optimality and extracting solutions in GloptiPoly

Didier Henrion;Jean-Bernard Lasserre

365
Citations
Convergent SDP-Relaxations in Polynomial Optimization with Sparsity

Jean B. Lasserre

347
Citations
An Introduction to Polynomial and Semi-Algebraic Optimization

Jean Bernard Lasserre

334
Citations
Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations

Jean B. Lasserre;Didier Henrion;Christophe Prieur;Emmanuel Trélat

331
Citations
An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs

Jean B. Lasserre

322
Citations
Markov chains and invariant probabilities

Onésimo Hernández-Lerma;Jean Bernard Lasserre

274
Citations
Convergent relaxations of polynomial matrix inequalities and static output feedback

D. Henrion;J.-B. Lasserre

263
Citations
An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs

Jean B. Lasserre

237
Citations
A modified shifting bottleneck procedure for job-shop scheduling

S. Dauzere-Peres;J.-B. Lasserre

198
Citations
An analytical expression and an algorithm for the volume of a convex polyhedron inR n

J. B. Lasserre

191
Citations
Multi-resource shop scheduling with resource flexibility

Stéphane Dauzère-Pérès;W. Roux;Jean B. Lasserre

176
Citations
Semidefinite Programming vs. LP Relaxations for Polynomial Programming

Jean B. Lasserre

172
Citations
Introduction to Semidefinite, Conic and Polynomial Optimization

Miguel F. Anjos;Jean B. Lasserre

170
Citations
SIAM Journal on Optimization

C Audet;H H Bauschke;L T Biegler;P L Combettes

61
Citations
Convergent SDP-relaxations for polynomial optimization with sparsity

Jean B. Lasserre

11
Citations

Frequent Co-Authors

Didier Henrion Laboratory for Analysis and Architecture of Systems

Onésimo Hernández-Lerma Instituto Politécnico Nacional

Stéphane Dauzère-Pérès École des Mines de Saint-Étienne

Mihai Putinar University of California, Santa Barbara

Francisco Facchinei Sapienza University of Rome

Monique Laurent Centrum Wiskunde & Informatica

Roberto Cominetti Adolfo Ibáñez University

Bernard Mourrain French Institute for Research in Computer Science and Automation - INRIA

Fabrice Gamboa Federal University of Toulouse Midi-Pyrénées

Kim-Chuan Toh National University of Singapore

External Links

Wikipedia of Jean B. Lasserre Personal website of Jean B. Lasserre Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

For students pursuing Mathematics in the USA, exploring related online degrees can broaden career opportunities. Many professionals complement their math skills with business acumen by enrolling in fastest mba programs online. These programs offer accelerated paths to gain leadership expertise without pausing your career.

If marketing is of interest, a masters in marketing can blend quantitative analysis with creative strategy. This combination opens doors to roles requiring strong data interpretation and communication skills.

Some students prefer highly focused study options such as one year mba programs, which balance depth with speed to quickly advance career goals. These intensive degrees often appeal to math graduates eager to apply their analytical abilities in management.

For those who have already started business studies elsewhere, several mba programs that accept transfer credits enable seamless continuation. This flexibility helps students optimize time and minimize costs while completing their education.