Jean Bernard Lasserre

Jean Bernard Lasserre (born May 11, 1953 ) is a French mathematician.

Live and act

Lasserre studied at the École nationale supérieure d'informatique et de mathématiques appliquées (ENSIMAG) in Grenoble with an engineering degree in 1976 and received his doctorate in 1978 from the Paul Sabatier University in Toulouse, where he completed the second part of his doctorate in 1984 (Doctorat d´Etat). He then did research there for the CNRS . He is Research Director at the Laboratoire d'analysis et d'architecture des systèmes (LAAS) of the CNRS in Toulouse and also at the Mathematical Institute of the University of Toulouse.

1978/79 and 1985/86 he was visiting scholar at the University of California, Berkeley and was visiting scholar at Stanford University , Massachusetts Institute of Technology , MSRI , in Australia, Canada (Fields Institute, University of British Columbia), Mexico, Leiden and Amsterdam.

He deals with optimization, probability theory, real algebraic geometry, operations research and applied mathematics. He is a pioneer in the field of global polynomial optimization (Sum of Squares Optimization, Lasserre Hierarchy). An important point here is the possibility of approximating non-negative polynomials by polynomials that are sums of squares.

In 2015 he received the John von Neumann Theory Prize , in 2015 the Khachiyan Prize of the Optimization Society of INFORMS and in 2009 the Lagrange Prize of the SIAM and Mathematical Optimization Society. He is a Fellow of SIAM (2014) and received an ERC Advanced Grant in 2014.

Fonts

Books:

• An Integrated Approach in Production Planning and Scheduling, Lecture Notes in Economics and Mathematical Systems, Springer, Berlin 1994
• Markov Control Processes: Basic Optimality Criteria, Springer, New York, 1996
• Further Topics in Markov Control Processes, Springer, New York, 1999,
• Markov Chains and Invariant Probabilities, Birkhauser, 2003.
• Linear & Integer Programming vs Linear Integration and Counting, Springer, New York, 2009.
• Moments, Positive Polynomials and Their Applications, Imperial College Press, London, 2009
• Modern Optimization Modeling Techniques, Springer, New York, 2012
• An Introduction to Polynomial and Semi-Algebraic Optimization, Cambridge University Press, Cambridge, UK, 2015

Some essays:

• A sum of squares approximation of non-negative polynomials, SIAM Journal on Optimization, Volume 16, 2006, 751-765.
• Global optimization with polynomials and the problem of moments, SIAM Journal on Optimization, Volume 11, 2001, pp. 796-817.
• A semidefinite programming approach to the generalized problem of moments, Mathematical Programming, Volume 112, 2008, pp. 65-92.
• A Sum of Squares Approximation of Nonnegative Polynomials, SIAM Review, Volume 49, 2007, pp. 651-669.

Web links

• Homepage

Individual evidence

1. ↑ Laudation Lagrange Prize