Skip to Main content

Keywords

Semidefinite relaxations Numerical integration Linear matrix inequality 90C22 Computational geometry Semidefinite programming Orthogonal polynomials Statistics Global optimization Semi-algebraic sets Moment problems Moment problem Moments Optimization Sparsity Polynomial optimization Positive polynomials Homogeneous polynomials Optimal control Convex optimization
› Full list

Journal names

› Full list

Co-authors

› Full list

External widget

Number of documents

131

CV

I graduated from "Ecole Nationale Superieure d'Informatique et Mathematiques Appliquees"  (ENSIMAG) in Grenoble,  then got my PhD (1978) and "Doctorat d'Etat" (1984) degrees both from Paul Sabatier University in  Toulouse (France).

I have been at LAAS-CNRS in Toulouse since1980, where I am currently Directeur de Recherche. I am also a member of IMT,  the Institute of Mathematics of Toulouse. I was a one year visitor (1978-79 and 1985-86) at the  Electrical Engineering Dept. of the University of California at Berkeley with a fellowship from INRIA and NSF. 

I have done several one-month visits to Stanford University (Stanford, California), 
the Massachusetts Institute of Technology (MIT, Cambridge), the Mathematical Sciences Research Institute (MSRI, Berkeley), the Fields Institute (Fields, Toronto), the Institute for Mathematics and its Applications (IMA, Minneapolis), the Institute for Pure and Applied Mathematics (IPAM, UCLA), Cinvestav-IPN (Cinvestav, Mexico), Leiden University (Leiden, The Netherlands), the Tinbergen Institute (Tinbergen, Amsterdam, The Netherlands), the University of Adelaide (Adelaide, Australia), the University of South Australia (UniSA, Adelaide), the University of New South wales (UNSW, Sydney), the University of British Columbia (UBC, Vancouver). 

Awards & distinctions: 

- 2019 ISSAC' 20109 Distinguished Paper Award (Beijing, July 2019) with F. Bréhard & M. Joldès.

- 2018: Invited Speaker at the International Congress of Mathematicians (ICM 2018), Rio de Janeiro, August 2018. Section 16:  Optimal Control & Optimization.

- 2015 John von Neumann Theory prize of the INFORMS society. 

- 2015 Khachiyan prize of the Optimization Society of INFORMS. 

- 2009 Lagrange prize in Continuous optimization (awarded jointly every 3 years by SIAM and the Mathematical Optimization Society). 

- SIAM Fellow (class 2014) 

- 2014 Laureate of an ERC-Advanced Grant from the European Research Council (ERC) for the TAMING project. 

Journal articles82 documents

  • Jie Wang, Victor Magron, Jean-Bernard Lasserre. Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension. SIAM Journal on Optimization, Society for Industrial and Applied Mathematics, 2021, ⟨10.1137/20M1323564⟩. ⟨hal-02502131⟩
  • Swann Marx, Edouard Pauwels, Tillmann Weisser, Didier Henrion, Jean Lasserre. Semi-algebraic approximation using Christoffel-Darboux kernel. Constructive Approximation, Springer Verlag, 2021, ⟨10.1007/s00365-021-09535-4⟩. ⟨hal-02085835v3⟩
  • Jie Wang, Victor Magron, Jean-Bernard Lasserre. TSSOS: A Moment-SOS hierarchy that exploits term sparsity. SIAM Journal on Optimization, Society for Industrial and Applied Mathematics, 2021, 31 (1), pp.30--58. ⟨10.1137/19M1307871⟩. ⟨hal-02448389⟩
  • Jean-Bernard Lasserre. THE MOMENT-SOS HIERARCHY AND THE CHRISTOFFEL-DARBOUX KERNEL. Optimization Letters, Springer Verlag, 2021, pp.1835-1845. ⟨10.1007/s11590-021-01713-4⟩. ⟨hal-03008801⟩
  • Jean Lasserre, Tillmann Weisser. Distributionally robust polynomial chance-constraints under mixture ambiguity sets. Mathematical Programming, Series A, Springer, 2021, 185, pp.409--453. ⟨10.1007/s10107-019-01434-8⟩. ⟨hal-01755147v2⟩
  • Ngoc Hoang Anh Mai, Jean-Bernard Lasserre, Victor Magron. Positivity certificates and polynomial optimization on non-compact semialgebraic sets. Mathematical Programming, Series A, Springer, 2021, ⟨10.1007/s10107-021-01634-1⟩. ⟨hal-02382059⟩
  • Jean-Bernard Lasserre, Victor Magron, Swann Marx, Olivier Zahm. Minimizing rational functions: a hierarchy of approximations via pushforward measures. SIAM Journal on Optimization, Society for Industrial and Applied Mathematics, 2021, 31 (3), pp.2285-2306. ⟨10.1137/20M138541X⟩. ⟨hal-03053386⟩
  • Yohann de Castro, Fabrice Gamboa, Didier Henrion, Jean Lasserre. Dual optimal design and the Christoffel-Darboux polynomial. Optimization Letters, Springer Verlag, 2021, 15, pp.3-8. ⟨10.1007/s11590-020-01680-2⟩. ⟨hal-02931534v2⟩
  • Jean Lasserre. SIMPLE FORMULA FOR INTEGRATION OF POLYNOMIALS ON A SIMPLEX. BIT Numerical Mathematics, Springer Verlag, 2021, 61, pp.523--533. ⟨10.1007/s10543-020-00828-x⟩. ⟨hal-02266692v2⟩
  • Edouard Pauwels, Mihai Putinar, Jean-Bernard Lasserre. Data analysis from empirical moments and the Christoffel function. Foundations of Computational Mathematics, Springer Verlag, 2021, 21, pp.243--273. ⟨10.1007/s10208-020-09451-2⟩. ⟨hal-01845137v3⟩
  • Matteo Tacchi, Tillmann Weisser, Jean-Bernard Lasserre, Didier Henrion. Exploiting Sparsity for Semi-Algebraic Set Volume Computation. Foundations of Computational Mathematics, Springer Verlag, 2021, ⟨10.1007/s10208-021-09508-w⟩. ⟨hal-02010175v2⟩
  • Jean-Bernard Lasserre, Victor Magron. Computing the Hausdorff boundary measure of semi-algebraic sets. SIAM Journal on Applied Algebra and Geometry, Society for Industrial and Applied Mathematics 2020, 4 (3), pp.441-469. ⟨10.1137/20M1314392⟩. ⟨hal-02448149⟩
  • Jean Lasserre. Connecting optimization with spectral analysis of tri-diagonal matrices. Mathematical Programming, Series A, Springer, 2020, ⟨10.1007/s10107-020-01549-3⟩. ⟨hal-02190818v4⟩
  • Khazhgali Kozhasov, Jean-Bernard Lasserre. NONNEGATIVE FORMS WITH SUBLEVEL SETS OF MINIMAL VOLUME. Mathematical Programming, Series A, Springer, 2020, ⟨10.1007/s10107-020-01584-0⟩. ⟨hal-02294984v2⟩
  • Swann Marx, Tillmann Weisser, Didier Henrion, Jean Lasserre. A moment approach for entropy solutions to nonlinear hyperbolic PDEs *. Mathematical Control and Related Fields, AIMS, 2020, 10 (1), pp.113-140. ⟨10.3934/mcrf.2019032⟩. ⟨hal-01830870⟩
  • Jean Lasserre. VOLUME OF SUBLEVEL SETS OF HOMOGENEOUS POLYNOMIALS. SIAM Journal on Applied Algebra and Geometry, Society for Industrial and Applied Mathematics 2019, 3 (2), pp.372-389. ⟨10.1137/18M1222478⟩. ⟨hal-01898429v4⟩
  • Cédric Josz, Jean-Bernard Lasserre, Bernard Mourrain. Sparse polynomial interpolation: sparse recovery, super resolution, or Prony?. Advances in Computational Mathematics, Springer Verlag, 2019, 45 (3), pp.1401-1437. ⟨10.1007/s10444-019-09672-2⟩. ⟨hal-01575325v2⟩
  • Simon Foucart, Jean-Bernard Lasserre. Computation of Chebyshev Polynomials for Union of Intervals. Computational Methods and Function Theory, Springer, 2019, ⟨10.1007/s40315-019-00285-w⟩. ⟨hal-02062836⟩
  • Jean-Bernard Lasserre, Mihai Putinar. Positive Functionals and Hessenberg Matrices. Proceedings of the American Mathematical Society, American Mathematical Society, 2019, 147 (3), pp.1097--1108. ⟨10.1090/proc/14266⟩. ⟨hal-01806491⟩
  • Yohann de Castro, Fabrice Gamboa, Didier Henrion, Roxana Hess, Jean-Bernard Lasserre. Approximate Optimal Designs for Multivariate Polynomial Regression. Annals of Statistics, Institute of Mathematical Statistics, 2019, 47 (1), pp.127-155. ⟨10.1214/18-AOS1683⟩. ⟨hal-01483490v2⟩
  • Jean-Bernard Lasserre, Edouard Pauwels. The empirical Christoffel function with applications in data analysis. Advances in Computational Mathematics, Springer Verlag, 2019, 45 (3), pp.1439--1468. ⟨10.1007/s10444-019-09673-1⟩. ⟨hal-01511624⟩
  • Jean Lasserre, Youssouf Emin. Semidefinite Relaxations for Lebesgue and Gaussian Measures of Unions of Basic Semialgebraic Sets. Mathematics of Operations Research, INFORMS, 2019, 44 (4), pp.1145-1509. ⟨10.1287/moor.2018.0980⟩. ⟨hal-01543361⟩
  • Jean-Bernard Lasserre, Victor Magron. In SDP relaxations, inaccurate solvers do robust optimization. SIAM Journal on Optimization, Society for Industrial and Applied Mathematics, 2019, 29 (3), pp.2128-2145. ⟨10.1137/18M1225677⟩. ⟨hal-01915976⟩
  • Jean-Bernard Lasserre, Victor Magron. Optimal data fitting: a moment approach. SIAM Journal on Optimization, Society for Industrial and Applied Mathematics, 2018, 28 (4), pp.3127-3144. ⟨10.1137/18M1170108⟩. ⟨hal-01706850⟩
  • Simon Foucart, Jean-Bernard Lasserre. Determining Projection Constants of Univariate Polynomial Spaces. Journal of Approximation Theory, Elsevier, 2018, 235, pp.74-91. ⟨10.1016/j.jat.2018.06.002⟩. ⟨hal-01679124⟩
  • Tillmann Weisser, Jean-Bernard Lasserre, Kim-Chuan Toh. Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity. Mathematical Programming Computation, Springer, 2018, 10, pp.1--32. ⟨hal-01341931v3⟩
  • Jean-Bernard Lasserre, Toh Kim-Chuan, Yang Shouguang. A bounded degree SOS hierarchy for polynomial optimization . EURO Journal on Computational Optimization, Springer, 2017, 5 (1), pp.87--117. ⟨hal-01109125v2⟩
  • Eric B Chin, Jean-Bernard Lasserre, Natarajan Sukumar. Modeling crack discontinuities without element-partitioning in the extended fi nite element method. International Journal for Numerical Methods in Engineering, Wiley, 2017, 110 (11), pp.1021-1048. ⟨10.1002/nme.5436⟩. ⟨hal-01426656⟩
  • Jean-Bernard Lasserre. Computing gaussian & exponential measures of semi-algebraic sets. Advances in Applied Mathematics, Elsevier, 2017, 91, pp.137-163. ⟨hal-01185641v2⟩
  • Etienne de Klerk, Jean Lasserre, Monique Laurent, Zhao Sun. Bound-Constrained Polynomial Optimization Using Only Elementary Calculations. Mathematics of Operations Research, INFORMS, 2017, 42 (3), pp.834 - 853. ⟨10.1287/moor.2016.0829⟩. ⟨hal-01698348⟩
  • Yohann de Castro, Fabrice Gamboa, Didier Henrion, Jean-Bernard Lasserre. Exact solutions to Super Resolution on semi-algebraic domains in higher dimensions. IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2017, 63 (1), pp. 621-630. ⟨10.1109/TIT.2016.2619368⟩. ⟨hal-01114328v2⟩
  • Jean-Bernard Lasserre. Representation of chance-constraints with strong asymptotic guarantees. IEEE Control Systems Letters, IEEE, 2017, 1 (1), pp.50--55. ⟨10.1109/LCSYS.2017.2704295⟩. ⟨hal-01487006v2⟩
  • Roxana Hess, Didier Henrion, Jean-Bernard Lasserre, Tien Son Pham. Semidefinite approximations of the polynomial abscissa. SIAM Journal on Control and Optimization, Society for Industrial and Applied Mathematics, 2016, 54 (3), pp. 1633-1656. ⟨hal-01181623⟩
  • Jean-Bernard Lasserre. A MAX-CUT FORMULATION OF 0/1 PROGRAMS. Operations Research Letters, Elsevier, 2016, 44 (2), pp.158--164. ⟨hal-01154698v3⟩
  • V Jeyakumar †, Jean-Bernard Lasserre, G Li, T.S Pham. CONVERGENT SEMIDEFINITE PROGRAMMING RELAXATIONS FOR GLOBAL BILEVEL POLYNOMIAL OPTIMIZATION PROBLEMS *. SIAM Journal on Optimization, Society for Industrial and Applied Mathematics, 2016, 26 (1), pp.753--780. ⟨10.1137/15M1017922⟩. ⟨hal-01295159⟩
  • Jean-Bernard Lasserre. CONVEX OPTIMIZATION AND PARSIMONY OF L p -BALLS REPRESENTATION *. SIAM Journal on Optimization, Society for Industrial and Applied Mathematics, 2016, SIAM Journal on Optimization, 26 (1), pp.247--273. ⟨10.1137/140983082⟩. ⟨hal-01053891v3⟩
  • Edouard Pauwels, Didier Henrion, Jean-Bernard Lasserre. Linear conic optimization for inverse optimal control. SIAM Journal on Control and Optimization, Society for Industrial and Applied Mathematics, 2016, 54 (3), pp.1798-1825. ⟨10.1137/14099454X⟩. ⟨hal-01080428v3⟩
  • Jean-Bernard Lasserre. Lebesgue decomposition in action via semidefinite relaxations. Advances in Computational Mathematics, Springer Verlag, 2016, 42 (5), pp.1129-1148. ⟨10.1007/s10444-016-9456-1⟩. ⟨hal-01212385v2⟩
  • Romain Serra, Denis Arzelier, Mioara Joldes, Jean-Bernard Lasserre, Aude Rondepierre, et al.. Fast and Accurate Computation of Orbital Collision Probability for Short-Term Encounters. Journal of Guidance, Control, and Dynamics, American Institute of Aeronautics and Astronautics, 2016, 39 (5), pp.1009-1021. ⟨10.2514/1.G001353⟩. ⟨hal-01132149⟩
  • Victor Magron, Didier Henrion, Jean-Bernard Lasserre. Semidefinite approximations of projections and polynomial images of semialgebraic sets. SIAM Journal on Optimization, Society for Industrial and Applied Mathematics, 2015, 25 (4), pp. 2143-2164. ⟨hal-01075343v2⟩
  • Jean-Bernard Lasserre. Volume of slices and sections of the simplex in closed form. Optimization Letters, Springer Verlag, 2015, 9 (7), pp.1263--1269. ⟨hal-01095071⟩
  • Florian Bugarin, Adrien Bartoli, Didier Henrion, Jean-Bernard Lasserre, Jean-José Orteu, et al.. Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm. Journal of Mathematical Imaging and Vision, Springer Verlag, 2015, 53 (1), pp.42-60. ⟨hal-00723015v2⟩
  • Florian Bugarin, Didier Henrion, Jean-Bernard Lasserre. Minimizing the sum of many rational functions. Mathematical Programming Computation, Springer, 2015, 8 (1), pp. 83-111. ⟨10.1007/s12532-015-0089-z⟩. ⟨hal-00569067v2⟩
  • Jean-Bernard Lasserre. Moments and Legendre-Fourier Series for Measures Supported on Curves. Symmetry, Integrability and Geometry : Methods and Applications, National Academy of Science of Ukraine, 2015, Special Issue on Orthogonal Polynomials, Special Functions and Applications, 11 (077), 10 p. ⟨10.3842/SIGMA.2015.077⟩. ⟨hal-01187750v2⟩
  • Jean-Paul Laumond, Nicolas Mansard, Jean-Bernard Lasserre. Optimization as Motion Selection Principle in Robot Action. Communications of the ACM, Association for Computing Machinery, 2015, 58 (5), pp.64-74. ⟨10.1145/2743132⟩. ⟨hal-01376752⟩
  • Jean-Bernard Lasserre. A generalization of Löwner-John's ellipsoid theorem. Mathematical Programming, Series A, Springer, 2015, 152, pp.559--591. ⟨10.1007/s10107-014-0798-5⟩. ⟨hal-00785158v5⟩
  • Eric Chin, Jean Lasserre, N Sukumar. Numerical integration of homogeneous functions on convex and nonconvex polygons and polyhedra. Computational Mechanics, Springer Verlag, 2015, 56, pp.967 - 981. ⟨10.1007/s00466-015-1213-7⟩. ⟨hal-01426581⟩
  • Jean-Bernard Lasserre. Level sets and non Gaussian integrals of positively homogeneous functions. International Game Theory Review, World Scientific Publishing, 2015, 17 (1), pp.10.1142/S0219198915400010. ⟨10.1142/S0219198915400010⟩. ⟨hal-00637049v3⟩
  • Jean-Bernard Lasserre, Mihai Putinar. Algebraic-exponential data recovery from moments. Discrete and Computational Geometry, Springer Verlag, 2015, 54 (5), pp.993-1012. ⟨10.1007/s00454-015-9739-1⟩. ⟨hal-00936719v2⟩
  • Victor Magron, Didier Henrion, Jean-Bernard Lasserre. Approximating Pareto Curves using Semidefinite Relaxations. Operations Research Letters, Elsevier, 2014, 42 (6-7), pp.432-437. ⟨hal-00980625v2⟩
  • Didier Henrion, Jean-Bernard Lasserre, Martin Mevissen. Mean squared error minimization for inverse moment problems. Applied Mathematics and Optimization, Springer Verlag (Germany), 2014, 70 (1), pp. 83-110. ⟨hal-00725977⟩
  • Jean-Paul Laumond, Nicolas Mansard, Jean-Bernard Lasserre. Optimality in Robot Motion: Optimal Versus Optimized Motion. Communications of the ACM, Association for Computing Machinery, 2014, 57 (9), pp.82 - 89. ⟨10.1145/2629535⟩. ⟨hal-01376749⟩
  • Vaithilingam Jeyakumar, Jean-Bernard Lasserre, G. Li. On Polynomial Optimization over Non-compact Semi-algebraic Sets. Journal of Optimization Theory and Applications, Springer Verlag, 2014, 163, pp.707--718. ⟨10.1007/s10957-014-0545-3⟩. ⟨hal-00813962v2⟩
  • Jean-Bernard Lasserre. New approximations for the cone of copositive matrices and its dual. Mathematical Programming, Series A, Springer, 2014, 144, pp.265-276. ⟨10.1007/s10107-013-0632-5⟩. ⟨hal-00545755v2⟩
  • Jean-Bernard Lasserre. The K-moment problem for continuous linear functionals. Transactions of the American Mathematical Society, American Mathematical Society, 2013, 365, pp.2489--2504. ⟨hal-00570653v2⟩
  • Konstantin Avrachenkov, Jean-Bernard Lasserre. Analytic perturbation of generalized inverses. Linear Algebra and its Applications, Elsevier, 2013, 438 (4), pp.1793-1813. ⟨10.1016/j.laa.2011.10.037⟩. ⟨hal-00926609⟩
  • Jean-Bernard Lasserre. Recovering an homogeneous polynomial from moments of its level set. Discrete and Computational Geometry, Springer Verlag, 2013, 50 (3), pp. 673-678. ⟨hal-00725422⟩
  • Jean-Bernard Lasserre. Inverse polynomial optimization. Mathematics of Operations Research, INFORMS, 2013, 38 (3), pp.418-436. ⟨hal-00577168v3⟩
  • Jean-Bernard Lasserre. A Lagrangian relaxation view of linear and semidefinite hierarchies. SIAM Journal on Optimization, Society for Industrial and Applied Mathematics, 2013, 23, pp.1742--1756. ⟨hal-00742918⟩
  • Jean-Bernard Lasserre, Monique Laurent, Bernard Mourrain, Philipp Rostalski, Philippe Trébuchet. Moment Matrices, Border Bases and Real Radical Computation. Journal of Symbolic Computation, Elsevier, 2013, 51, pp.63-85. ⟨10.1016/j.jsc.2012.03.007⟩. ⟨hal-00651759⟩
  • Jean-Bernard Lasserre. Borel measures with a density on a compact semi-algebraic set. Archiv der Mathematik, Springer Verlag, 2013, 101, pp.361--371. ⟨10.1007/s00013-013-0557-5⟩. ⟨hal-00808538v2⟩
  • Jean-Bernard Lasserre. Existence of Gaussian cubature formulas. Journal of Approximation Theory, Elsevier, 2012, 164 (5), p. 572-585. ⟨hal-00595007v2⟩
  • Greg Blekherman, Jean-Bernard Lasserre. The truncated K-Moment problem for closure of open sets. Journal of Functional Analysis, Elsevier, 2012, 263 (11), pp. 3604-3616. ⟨hal-00613043v2⟩
  • Jean-Bernard Lasserre. An algorithm for semi-infinite polynomial optimization. TOP, Springer Verlag, 2012, 20 (1), p.119-129. ⟨hal-00558159⟩
  • Didier Henrion, Jean-Bernard Lasserre. Inner approximations for polynomial matrix inequalities and robust stability regions. IEEE Transactions on Automatic Control, Institute of Electrical and Electronics Engineers, 2012, 57 (6), p.1456-1467. ⟨hal-00588754v2⟩
  • Rida Laraki, Jean-Bernard Lasserre. SEMIDEFINITE PROGRAMMING FOR MIN-MAX PROBLEMS AND GAMES. Mathematical Programming, Series A, Springer, 2012, 131 (1-2), pp. 305-332. ⟨hal-00331529v2⟩
  • Jean-Bernard Lasserre, Thanh Tung Phan. A "joint+marginal" heuristic for 0/1 programs. Journal of Global Optimization, Springer Verlag, 2012, 54, pp.729--744. ⟨hal-00463095v2⟩
  • Jean-Bernard Lasserre. On Convex optimization without convex representation. Optimization Letters, Springer Verlag, 2011, 5 (4), p. 549-556. ⟨hal-00495396v3⟩
  • Jean-Bernard Lasserre. A new look at nonnegativity on closed sets and polynomial optimization. SIAM Journal on Optimization, Society for Industrial and Applied Mathematics, 2011, 21 (3), pp.864-885. ⟨hal-00512560v3⟩
  • Jean-Bernard Lasserre. Bounding the support of a measure from its marginal moments. Proceedings of the American Mathematical Society, American Mathematical Society, 2011, 139 (9), p. 3375-3382. ⟨hal-00530932⟩
  • Jean-Bernard Lasserre, Mihai Putinar. Positivity and optimization for semi-algebraic functions. SIAM Journal on Optimization, Society for Industrial and Applied Mathematics, 2010, 20, pp.3364--3383. ⟨10.1137/090775221⟩. ⟨hal-00430192⟩
  • Jean-Bernard Lasserre. Certificates of convexity for basic semi-algebraic sets. Applied Mathematics Letters, Elsevier, 2010, 23 (8), p. 912-916. ⟨hal-00356714v2⟩
  • Jean-Bernard Lasserre. On representations of the feasible set in convex optimization. Optimization Letters, Springer Verlag, 2010, 4 (1), p. 1-5. ⟨10.1007/s11590-009-0153-6⟩. ⟨hal-00430141⟩
  • Jean-Bernard Lasserre, Eduardo Zeron. Lp-norms, Log-barriers and Cramer transform in Optimization. Set Valued Analysis, 2010, 18 (3-4), p.513-530. ⟨hal-00444812v2⟩
  • Jean-Bernard Lasserre. A "joint+marginal" approach to parametric polynomial optimization. SIAM Journal on Optimization, Society for Industrial and Applied Mathematics, 2010, 20 (4), pp. 1995-2022. ⟨hal-00384400⟩
  • Didier Henrion, Jean-Bernard Lasserre, Carlo Savorgnan. Approximate volume and integration for basic semi-algebraic sets. SIAM Review, Society for Industrial and Applied Mathematics, 2009, 51 (4), pp.722-743. ⟨hal-00297384v2⟩
  • Jean-Bernard Lasserre. Convex sets with semidefinite representation. Mathematical Programming, Series A, Springer, 2009, 120 (2), pp.457-477. ⟨10.1007/s10107-008-0222-0⟩. ⟨hal-00331665⟩
  • Didier Henrion, Jean-Bernard Lasserre, Johan Lofberg. GloptiPoly 3: moments, optimization and semidefinite programming. Optimization Methods and Software, Taylor & Francis, 2009, 24 (4-5), pp. 761-779. ⟨hal-00172442⟩
  • Jean-Bernard Lasserre, Didier Henrion, Christophe Prieur, Emmanuel Trélat. Nonlinear optimal control via occupation measures and LMI-relaxations. SIAM Journal on Control and Optimization, Society for Industrial and Applied Mathematics, 2008, 47 (4), pp.1643--1666. ⟨hal-00136032v3⟩
  • Rida Laraki, Jean-Bernard Lasserre. Computing uniform convex approximations for convex envelopes and convex hulls. Journal of Convex Analysis, Heldermann, 2008, 15 (3), pp.635-654. ⟨hal-00243009⟩
  • Gérard Fontan, Colette Mercé, Jean-Claude Hennet, Jean-Bernard Lasserre. Hierarchical scheduling for decision support. Journal of Intelligent Manufacturing, Springer Verlag (Germany), 2005, 16 (2), pp.235-242. ⟨hal-00860414⟩
  • Stéphane Dauzère-Pérès, Jean-Bernard Lasserre. On the Importance of Sequencing Decisions in Production Planning and Scheduling. International Transactions in Operational Research, Wiley, 2002, 9 (6), pp.779-793. ⟨10.1111/1475-3995.00388⟩. ⟨emse-00520345⟩

Conference papers19 documents

  • Bachir El Khadir, Jean-Bernard Lasserre, Vikas Sindhwani. Piecewise-Linear Motion Planning amidst Static, Moving, or Morphing Obstacles. IEEE International Conference on Robotics and Automation, IEEE Robotics & Automation Society, May 2021, Xi'an, China. ⟨hal-02971806⟩
  • Didier Henrion, Matteo Tacchi, Carmen Cardozo, Jean Lasserre. Approximating regions of attraction of a sparse polynomial differential system *. IFAC World Congress, Jul 2020, virtual, Germany. pp.3266-3271, ⟨10.1016/j.ifacol.2020.12.1488⟩. ⟨hal-02367689v2⟩
  • Tong Chen, Jean-Bernard Lasserre, Victor Magron, Edouard Pauwels. Semialgebraic Optimization for Lipschitz Constants of ReLU Networks. Conference on Neural Information Processing Systems, Dec 2020, Vancouver, Canada. ⟨hal-02940488⟩
  • Jean Lasserre. Volume of sub-level sets of polynomials. 18th European Control Conference (ECC 2019), Jun 2019, Naples, Italy. pp.1975-1980, ⟨10.23919/ECC.2019.8795995⟩. ⟨hal-02277745⟩
  • Florent Bréhard, Mioara Joldes, Jean-Bernard Lasserre. On Moment Problems with Holonomic Functions. 44th International Symposium on Symbolic and Algebraic Computation (ISSAC 2019), Jul 2019, Pékin, China. pp.66-73. ⟨hal-02006645⟩
  • Jean Lasserre. THE MOMENT-SOS HIERARCHY. International Congress of Mathematicians 2018 (ICM 2018), Aug 2018, Rio de Janeiro, Brazil. 21p. ⟨hal-01856182⟩
  • Jean-Bernard Lasserre, Jérémy Rouot. On inverse optimal control via polynomial optimization. IEEE 56th Annual Conference on Decision and Control (CDC 2017), Dec 2017, Melbourne, Australia. pp.721-726, ⟨10.1109/CDC.2017.8263745⟩. ⟨hal-01493034⟩
  • Jean-Bernard Lasserre, Edouard Pauwels. Sorting out typicality with the inverse moment matrix SOS polynomial. Neural Information Processing Systems (NIPS 2016), Dec 2016, Barcelone, Spain. ⟨hal-01331591⟩
  • Edouard Pauwels, Didier Henrion, Jean-Bernard Lasserre. Inverse optimal control with polynomial optimization. IEEE Conference on Decision and Control ( CDC ), Dec 2014, Los Angeles, United States. pp.5581-5586. ⟨hal-00961722⟩
  • Romain Serra, Denis Arzelier, Mioara Joldes, Jean-Bernard Lasserre, Aude Rondepierre, et al.. A New Method to Compute the Probability of Collision for Short-term Space Encounters. AIAA/AAS Astrodynamics Specialist Conference, Aug 2014, San Diego, United States. 6p., ⟨10.2514/6.2014-4366⟩. ⟨hal-01092420⟩
  • Mathieu Claeys, Denis Arzelier, Didier Henrion, Jean-Bernard Lasserre. Moment LMI approach to LTV impulsive control. IEEE Conference on Decision and Control ( CDC ), Dec 2013, Florence, Italy. pp. 5810-5815. ⟨hal-00797951⟩
  • Mathieu Claeys, Denis Arzelier, Didier Henrion, Jean-Bernard Lasserre. Measures and LMI for impulsive optimal control with applications to space rendezvous problems. American Control Conference (ACC 2012), Jun 2012, Montreal, Canada. pp.161-166. ⟨hal-00633138⟩
  • Bernard Mourrain, Monique Laurent, Jean-Bernard Lasserre, Philippe Trébuchet. Moment matrices, border bases and real radical computation. MEGA2011, May 2011, Stockholm, Sweden. pp.1-23. ⟨hal-01282654⟩
  • Florian Bugarin, Didier Henrion, Jean-José Orteu, Thierry Sentenac, Jean-Bernard Lasserre. Application de l'optimisation globale par théorie des moments aux problèmes d'estimation issus de la vision artificielle. Ecole de Printemps en Traitement d'Image, Martel (France), 18-22 avril 2011, 2011, Martel, France. ⟨hal-02056683⟩
  • Florian Bugarin, Didier Henrion, Jean-José Orteu, Thierry Sentenac, Jean-Bernard Lasserre. Application de l'optimisation globale par théorie des moments aux problèmes d'estimation issus de la vision artificielle. Journée GDR ISIS, Paris (France), 2011., 2011, Paris, France. ⟨hal-02056682⟩
  • Florian Bugarin, Didier Henrion, Jean-José Orteu, Thierry Sentenac, Jean-Bernard Lasserre. Application de l'optimisation globale par théorie des moments aux problèmes d'estimation issus de la vision artificielle. Congrès de l'École Doctorale Systèmes (EDSYS), Toulouse (France), 10-11 mai 2011, 2011, Toulouse, France. ⟨hal-02056681⟩
  • Martin Mevissen, Jean-Bernard Lasserre, Didier Henrion. Moment and SDP relaxation techniques for smooth approximations of problems involving nonlinear differential equations. World IFAC Congress (IFAC 2011), Aug 2011, Milan, Italy. p. 10887-10892. ⟨hal-00462301v2⟩
  • Florian Bugarin, Didier Henrion, Thierry Sentenac, Jean-Bernard Lasserre, Jean-José Orteu. Optimisation globale polynomiale appliquée à la rectification projective d'images non calibrées. French Conference on Pattern Recognition and Artificial Intelligence (RFIA 2010), Jan 2010, Caen, France. 8p. ⟨hal-00420081⟩
  • Didier Henrion, Jean-Bernard Lasserre, Carlo Savorgnan. Nonlinear optimal control synthesis via occupation measures. 47th IEEE Conference on Decision and Control, Dec 2008, Cancun, Mexico. 16p. ⟨hal-00262309⟩

Books8 documents

Book sections1 document

  • Edouard Pauwels, Didier Henrion, Jean-Bernard Lasserre. Positivity certificates in optimal control. Springer. Geometric and Numerical Foundations of Movements, 117, Springer, pp.113-131, 2017, Springer Tracts in Advanced Robotics, 978-3-319-51546-5. ⟨hal-01311874⟩

Directions of work or proceedings1 document

  • Jean-Paul Laumond, Nicolas Mansard, Jean-Bernard Lasserre. Geometric and Numerical Foundations of Movements. Springer. France. 117, Springer International Publishing, 2017, Springer Tracts in Advanced Robotics, 978-3-319-51546-5. ⟨10.1007/978-3-319-51547-2⟩. ⟨hal-01590779⟩

Preprints, Working Papers, ...17 documents

  • Denis Arzelier, Florent Bréhard, Mioara Joldeş, Jean-Bernard Lasserre, Sohie Laurens, et al.. Polynomial superlevel set approximation of swept-volume for computing collision probability in space encounters. 2021. ⟨hal-03158347⟩
  • Tong Chen, Jean-Bernard Lasserre, Victor Magron, Edouard Pauwels. Semialgebraic Representation of Monotone Deep Equilibrium Models and Applications to Certification. 2021. ⟨hal-03265346⟩
  • Ngoc Hoang Anh Mai, Victor Magron, Jean-Bernard Lasserre. A hierarchy of spectral relaxations for polynomial optimization. 2021. ⟨hal-03149938⟩
  • Tong Chen, Jean-Bernard Lasserre, Victor Magron, Edouard Pauwels. A Sublevel Moment-SOS Hierarchy for Polynomial Optimization. 2021. ⟨hal-03109978⟩
  • Jean-Bernard Lasserre. OPTIMIZATION ON THE EUCLIDEAN UNIT SPHERE. 2021. ⟨hal-03291242⟩
  • Jie Wang, Victor Magron, Jean Lasserre, Ngoc Hoang Anh Mai. CS-TSSOS: Correlative and term sparsity for large-scale polynomial optimization. 2020. ⟨hal-02566472⟩
  • Matteo Tacchi, Jean Lasserre, Didier Henrion. Stokes, Gibbs and volume computation of semi-algebraic sets. 2020. ⟨hal-02947268⟩
  • Jean-Bernard Lasserre. HOMOGENEOUS POLYNOMIALS AND SPURIOUS LOCAL MINIMA ON THE UNIT SPHERE. 2020. ⟨hal-02966390v2⟩
  • Ngoc Hoang Anh Mai, Jean-Bernard Lasserre, Victor Magron, Jie Wang. Exploiting constant trace property in large-scale polynomial optimization. 2020. ⟨hal-03079000⟩
  • Didier Henrion, Jean Lasserre. Graph Recovery From Incomplete Moment Information. 2020. ⟨hal-02990825v2⟩
  • N. H. A. Mai, Victor Magron, Jean-Bernard Lasserre. A sparse version of Reznick's Positivstellensatz. 2020. ⟨hal-02477339⟩
  • Milan Korda, Didier Henrion, Jean-Bernard Lasserre. Moments and convex optimization for analysis and control of nonlinear partial differential equations. 2018. ⟨hal-01771699⟩
  • Jean-Bernard Lasserre. Best $\ell_1$-approximation of nonnegative polynomials by sums of squares. 2010. ⟨hal-00546660⟩
  • Jean-Bernard Lasserre, Eduardo Zeron. Certificates and relaxations for integer programming and the semi-group membership problem. 2009. ⟨hal-00382774⟩
  • Didier Henrion, Jean-Bernard Lasserre, Carlo Savorgnan. POCP: a package for polynomial optimal control problems. 2008. ⟨hal-00325180⟩
  • Jean-Bernard Lasserre. The moment problem with bounded density. 2006. ⟨hal-00143750⟩
  • Jean-Bernard Lasserre. A Positivstellensatz which Preserves the Coupling Pattern of Variables. 2006. ⟨hal-00143641⟩

Reports3 documents

  • Denis Arzelier, Florent Bréhard, Mioara Joldes, Jean-Bernard Lasserre, Aude Rondepierre. Rigorous derivation of Coppola's formula for the computation of the probability of collision between space objects. [Research Report] Rapport LAAS n° 20008, LAAS-CNRS. 2020. ⟨hal-02444341⟩
  • Denis Arzelier, Florent Bréhard, Mioara Joldes, Jean-Bernard Lasserre, Léo Martire, et al.. Global Probability of Collision: Problem modeling via occupation measures. DAJ/AR/EO-2016-6457, LAAS / CNRS; CNES. 2019. ⟨hal-02077552⟩
  • Romain Serra, Denis Arzelier, Mioara Joldes, Jean-Bernard Lasserre, Aude Rondepierre, et al.. A Power Series Expansion based Method to compute the Probability of Collision for Short-term Space Encounters. [Research Report] LAAS-CNRS. 2015. ⟨hal-01131384v2⟩