Annuaire

Jean-Bernard Lasserre

Jean-Bernard Lasserre

Équipe

POP : Polynomial OPtimization

Coordonnées

Courriel :

Téléphone :

Liens

Actualités

LaasCNRS_JBLasserre

Jean-Bernard Lasserre, lauréat de l'ERC

Distinctions

Jean-Bernard Lasserre, directeur de recherche au sein de l'équipe MAC du LAAS-CNRS, a obtenu une bourse Advanced Grants du Conseil européen de la recherche (ERC) pour son projet TAMING. (Juillet 2016)

+

Toutes les actualités de Jean-Bernard Lasserre

Dernières Publications

2025

Articles dans une revue

Jean-Bernard Lasserre. A hierarchy of convex relaxations for the total variation distance. Mathematical Programming, Series A, In press, 8 p. ⟨10.1007/s10107-025-02293-2⟩. ⟨hal-04367575v4⟩

Jean B Lasserre. An extension of the mean value theorem. The Mathematical Intelligencer, In press, 4 p. ⟨hal-05289719⟩

Jean B Lasserre. A laplace duality for integration. IEEE Control Systems Letters, 2025, 9, pp.168 - 173. ⟨10.1109/LCSYS.2025.3567851⟩. ⟨hal-04970360v3⟩

Rapports

Giovanni Fantuzzi, David Goluskin, Jean Bernard Lasserre. Polynomial Optimization for Nonlinear Dynamics: Theory, Algorithms and Applications. Oberwolfach Institute. 2025, pp.1975-2032. ⟨hal-04954840⟩

Pré-publications, documents de travail

Srećko Ðurašinović, Perla Azzi, Jean-Bernard Lasserre, Victor Magron, Olga Mula, et al.. Leveraging Christoffel-Darboux Kernels to Strengthen Moment-SOS Relaxations. 2025. ⟨hal-04913273⟩

Srecko Durasinovic, Jean B Lasserre, Victor Magron. Mixtures Closest to a Given Measure: A Semidefinite Programming Approach. 2025. ⟨hal-05289733⟩

Jean B Lasserre. Rank conditions for exactness of semidefinite relaxations in polynomial optimization. 2025. ⟨hal-04877125⟩

Saroj Prasad Chhatoi, Jean B Lasserre. Shannon-and von neumann-entropy regularizations of linear and semidefinite programs. 2025. ⟨hal-05010676v2⟩

2024

Articles dans une revue

Jean-Bernard Lasserre, Yuan Xu. A Generalized Pell's equation for a class of multivariate orthogonal polynomials. Transactions of the American Mathematical Society, In press, 23 p. ⟨10.1090/tran/9200⟩. ⟨hal-04163153v2⟩

Jean-Bernard Lasserre. Gaussian mixtures closest to a given measure via optimal transport. Comptes Rendus. Mathématique, 2024, 362, pp.1455-1473. ⟨10.5802/crmath.657⟩. ⟨hal-04560365⟩

Jean-Bernard Lasserre. The Christoffel function: Applications, connections and extensions. Numerical Algebra, Control and Optimization, In press, ⟨10.3934/naco.2024011⟩. ⟨hal-04488686⟩

Jean-Bernard Lasserre. The Moment-SOS hierarchy: Applications and related topics. Acta Numerica, 2024, 33, pp.841-908. ⟨10.1017/S0962492923000053⟩. ⟨hal-04687963⟩

Adrien Le Franc, Victor Magron, Jean-Bernard Lasserre, Manuel Ruiz, Patrick Panciatici. Minimal Sparsity for Second-Order Moment-SOS Relaxations of the AC-OPF Problem. IEEE Transactions on Power Systems, 2024, 39 (3), pp.5408 - 5415. ⟨10.1109/TPWRS.2023.3333691⟩. ⟨hal-04110742v2⟩

Jean-Bernard Lasserre. CHEBYSHEV AND EQUILIBRIUM MEASURE VS BERNSTEIN AND LEBESGUE MEASURE. Proceedings of the American Mathematical Society, In press, ⟨10.1090/proc/16739⟩. ⟨hal-04043186⟩

Kévin Ducharlet, Louise Travé-Massuyès, Jean-Bernard Lasserre, Marie-Véronique Le Lann, Youssef Miloudi. Leveraging the Christoffel function for outlier detection in data streams. International Journal of Data Science and Analytics, In press, pp.doi.org/10.1007/s41060-024-00581-2. ⟨10.1007/s41060-024-00581-2⟩. ⟨hal-04630422⟩

Communications dans un congrès

Louise Travé-Massuyès, Kévin Ducharlet, Jean-Bernard Lasserre. Leveraging the properties of the Christoffel function for anomaly detection in data streams. Congrès Annuel de la SAGIP, SAGIP, May 2024, Lyon, France. ⟨hal-04794461⟩

Yukai Tang, Jean-Bernard Lasserre, Heng Yang. Uncertainty Quantification of Set-Membership Estimation in Control and Perception: Revisiting the Minimum Enclosing Ellipsoid. L4DC 2024, Jul 2024, Oxford (UK), France. pp.1--36. ⟨hal-04697144⟩

Jianting Yang, Srećko Ðurašinović, Jean-Bernard Lasserre, Victor Magron, Jun Zhao. Verifying Properties of Binary Neural Networks Using Sparse Polynomial Optimization. Thirteenth International Conference on Learning Representations (ICLR), 2025, Apr 2025, Singapour, Singapore. 22 p. ⟨hal-04589986⟩

Autres documents

Srećko Đurašinović, Jianting Yang, Jean-Bernard Lasserre, Victor Magron, Jun Zhao. Verifying Properties of Binary Neural Networks Using Sparse Polynomial Optimization. R&T Days 2024, Jul 2024, Toulouse (FRANCE), France. 2024. ⟨hal-04720757⟩

Pré-publications, documents de travail

Mareike Dressler, Simon Foucart, Mioara Joldeş, Etienne de Klerk, Jean-Bernard Lasserre, et al.. Optimization-Aided Construction of Multivariate Chebyshev Polynomials. 2024. ⟨hal-04727486⟩

Mareike Dressler, Simon Foucart, Mioara Joldeş, Etienne de Klerk, Jean-Bernard Lasserre, et al.. Least multivariate Chebyshev polynomials on diagonally determined domains. 2024. ⟨hal-04727563⟩

Didier Henrion, Jean-Bernard Lasserre. An infinite-dimensional Christoffel function and detection of abnormal trajectories. 2023. ⟨hal-04631100⟩

Didier Henrion, Jean Bernard Lasserre. Approximate D-optimal design and equilibrium measure. 2025. ⟨hal-04688534v3⟩

2023

Articles dans une revue

Khazhgali Kozhasov, Jean-Bernard Lasserre. Volumes of sublevel sets of nonnegative forms and complete monotonicity. SIAM Journal on Applied Algebra and Geometry, 2023, 7 (4), ⟨10.1137/22M1502458⟩. ⟨hal-03693810⟩

Matteo Tacchi, Jean Bernard Lasserre, Didier Henrion. Stokes, Gibbs and volume computation of semi-algebraic sets. Discrete and Computational Geometry, 2023, 69 (1), pp.260-283. ⟨10.1007/s00454-022-00462-0⟩. ⟨hal-02947268v3⟩

Jean-Bernard Lasserre. Pell's equation, sum-of-squares and equilibrium measures of a compact set. Comptes Rendus. Mathématique, 2023, 361 (1), pp.935-952. ⟨10.5802/crmath.465⟩. ⟨hal-03813195v2⟩

Jean-Bernard Lasserre. A modified Christoffel function and its asymptotic properties. Journal of Approximation Theory, 2023, 295, pp.105955. ⟨10.1016/j.jat.2023.105955⟩. ⟨hal-03949201v2⟩

Didier Henrion, Felix Kirschner, Etienne de Klerk, Milan Korda, Jean-Bernard Lasserre, et al.. Revisiting semidefinite programming approaches to options pricing: complexity and computational perspectives. INFORMS Journal on Computing, 2023, 35 (2), pp.265-517. ⟨10.1287/ijoc.2022.1220⟩. ⟨hal-03429272v2⟩

Chapitres d’ouvrages

Jean-Bernard Lasserre. Polynomial Optimization, Certificates of Positivity, and Christoffel Function. Michal Kočvara; Bernard Mourrain; Cordian Riener. Polynomial Optimization, Moments, and Applications, Springer, pp.1-20, 2023. ⟨hal-04076663⟩

Pré-publications, documents de travail

Didier Henrion, Milan Korda, Jean-Bernard Lasserre. POLYNOMIAL ARGMIN FOR RECOVERY AND APPROXIMATION OF MULTIVARIATE DISCONTINUOUS FUNCTIONS. 2023. ⟨hal-03986252v3⟩

Jean-Bernard Lasserre. The Moment-SOS hierarchy: Applications and related topics. 2023. ⟨hal-04201167⟩

2022

Articles dans une revue

Ngoc Hoang Anh Mai, Jean-Bernard Lasserre, Victor Magron, Jie Wang. Exploiting constant trace property in large-scale polynomial optimization. ACM Transactions on Mathematical Software, 2022, 48 (4), pp.1-39. ⟨10.1145/3555309⟩. ⟨hal-03079000⟩

Jie Wang, Victor Magron, Jean-Bernard Lasserre. Certifying Global Optimality of AC-OPF Solutions via the CS-TSSOS Hierarchy. Electric Power Systems Research, 2022, 213, pp.108683. ⟨10.1016/j.epsr.2022.108683⟩. ⟨hal-03351160⟩

Jean-Bernard Lasserre. Homogeneous polynomials and spurious local minima on the unit sphere. Optimization Letters, 2022, 46 (4), pp.1105-1118. ⟨10.1007/s11590-021-01811-3⟩. ⟨hal-02966390v2⟩

Jean-Bernard Lasserre. A DISINTEGRATION OF THE CHRISTOFFEL FUNCTION. Comptes Rendus. Mathématique, 2022, 360, pp.1071--1079. ⟨10.5802/crmath.380⟩. ⟨hal-03624003v2⟩

Jean-Bernard Lasserre. Optimization on the Euclidean Unit Sphere. SIAM Journal on Optimization, 2022, 32 (2), pp.1430--1445. ⟨10.1137/21M1433150⟩. ⟨hal-03291242v2⟩

N. H. A. Mai, Victor Magron, Jean-Bernard Lasserre. A sparse version of Reznick's Positivstellensatz. Mathematics of Operations Research, 2022, ⟨10.1287/moor.2022.1284⟩. ⟨hal-02477339⟩

Jean-Bernard Lasserre. ON THE CHRISTOFFEL FUNCTION AND CLASSIFICATION IN DATA ANALYSIS. Comptes Rendus. Mathématique, 2022, 360, pp.919--928. ⟨10.5802/crmath.358⟩. ⟨hal-03620965v2⟩

Didier Henrion, Jean B Lasserre. Graph Recovery From Incomplete Moment Information. Constructive Approximation, 2022, 6, pp.165-187. ⟨10.1007/s00365-022-09563-8⟩. ⟨hal-02990825v2⟩

Tong Chen, Jean-Bernard Lasserre, Victor Magron, Edouard Pauwels. A Sublevel Moment-SOS Hierarchy for Polynomial Optimization. Computational Optimization and Applications, 2022, 81 (1), pp.31-66. ⟨10.1007/s10589-021-00325-z⟩. ⟨hal-03109978⟩

Livres

Jean-Bernard Lasserre, Edouard Pauwels, Mihai Putinar. The Christoffel-Darboux Kernel for Data Analysis. Cambridge University Press. Cambridge University Press, 2022, Cambridge Monographs on Applied and Computational Mathematics, 9781108937078. ⟨hal-03590829⟩

Chapitres d’ouvrages

Milan Korda, Didier Henrion, Jean-Bernard Lasserre. Moments and convex optimization for analysis and control of nonlinear partial differential equations. Elsevier. Handbook of Numerical Analysis, 23, Elsevier, pp.339--366, 2022. ⟨hal-01771699⟩

Communications dans un congrès

Jean-Bernard Lasserre. The Christoffel-Darboux Kernel for Data Analysis. 23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne - Lyon, France. ⟨hal-03595424⟩

Jean-Bernard Lasserre. Optimization of Polynomials with Sparsity Encoded in a Few Linear Forms. 25th International Symposium on Mathematical Theory of Networks and Systems (MTNS 2022), Sep 2022, Beyreuth, Germany. pp.383-387. ⟨hal-03628891⟩

Autres documents

Jean B Lasserre. Moment-SOS Hierarchies. Encyclopedia of Optimization, 2022, pp.1-7. ⟨10.1007/978-3-030-54621-2_740-1⟩. ⟨hal-04054990⟩

Pré-publications, documents de travail

Milan Korda, Jean-Bernard Lasserre, Alexey Lazarev, Victor Magron, Simone Naldi. Urysohn in action: separating semialgebraic sets by polynomials. 2022. ⟨hal-03712510⟩

Ngoc Hoang Anh Mai, Victor Magron, Jean-Bernard Lasserre, Kim-Chuan Toh. Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant. 2022. ⟨hal-03776853⟩

Kévin Ducharlet, Louise Travé-Massuyès, Jean-Bernard Lasserre, Marie-Véronique Le Lann, Youssef Miloudi. Leveraging the Christoffel-Darboux Kernel for Online Outlier Detection. 2022. ⟨hal-03562614⟩

2021

Articles dans une revue

Jean-Bernard Lasserre, Victor Magron, Swann Marx, Olivier Zahm. Minimizing rational functions: a hierarchy of approximations via pushforward measures. SIAM Journal on Optimization, 2021, 31 (3), pp.2285-2306. ⟨10.1137/20M138541X⟩. ⟨hal-03053386⟩

Jean-Bernard Lasserre. THE MOMENT-SOS HIERARCHY AND THE CHRISTOFFEL-DARBOUX KERNEL. Optimization Letters, 2021, 15, pp.1835-1845. ⟨10.1007/s11590-021-01713-4⟩. ⟨hal-03008801⟩

Matteo Tacchi, Tillmann Weisser, Jean-Bernard Lasserre, Didier Henrion. Exploiting Sparsity for Semi-Algebraic Set Volume Computation. Foundations of Computational Mathematics, 2021, 22, pp.161--209. ⟨10.1007/s10208-021-09508-w⟩. ⟨hal-02010175v2⟩

Ngoc Hoang Anh Mai, Jean-Bernard Lasserre, Victor Magron. Positivity certificates and polynomial optimization on non-compact semialgebraic sets. Mathematical Programming, Series A, 2021, ⟨10.1007/s10107-021-01634-1⟩. ⟨hal-02382059⟩

Jie Wang, Victor Magron, Jean-Bernard Lasserre. Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension. SIAM Journal on Optimization, 2021, ⟨10.1137/20M1323564⟩. ⟨hal-02502131⟩

Swann Marx, Edouard Pauwels, Tillmann Weisser, Didier Henrion, Jean B Lasserre. Semi-algebraic approximation using Christoffel-Darboux kernel. Constructive Approximation, 2021, 54 (3), pp.391-429. ⟨10.1007/s00365-021-09535-4⟩. ⟨hal-02085835v3⟩

Jean B Lasserre. SIMPLE FORMULA FOR INTEGRATION OF POLYNOMIALS ON A SIMPLEX. BIT Numerical Mathematics, 2021, 61, pp.523--533. ⟨10.1007/s10543-020-00828-x⟩. ⟨hal-02266692v2⟩

Jie Wang, Victor Magron, Jean-Bernard Lasserre. TSSOS: A Moment-SOS hierarchy that exploits term sparsity. SIAM Journal on Optimization, 2021, 31 (1), pp.30--58. ⟨10.1137/19M1307871⟩. ⟨hal-02448389⟩

Jean B Lasserre, Tillmann Weisser. Distributionally robust polynomial chance-constraints under mixture ambiguity sets. Mathematical Programming, Series A, 2021, 185, pp.409--453. ⟨10.1007/s10107-019-01434-8⟩. ⟨hal-01755147v2⟩

Yohann de Castro, Fabrice Gamboa, Didier Henrion, Jean B Lasserre. Dual optimal design and the Christoffel-Darboux polynomial. Optimization Letters, 2021, 15 (1), pp.3-8. ⟨10.1007/s11590-020-01680-2⟩. ⟨hal-02931534v2⟩

Edouard Pauwels, Mihai Putinar, Jean-Bernard Lasserre. Data analysis from empirical moments and the Christoffel function. Foundations of Computational Mathematics, 2021, 21, pp.243--273. ⟨10.1007/s10208-020-09451-2⟩. ⟨hal-01845137v3⟩

Communications dans un congrès

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. 60th IEEE Conference on Decision and Control (CDC 2021), IEEE, Dec 2021, Austin, Texas, United States. ⟨10.1109/CDC45484.2021.9683445⟩. ⟨hal-03158347⟩

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 (ICRA 2021), IEEE Robotics & Automation Society, May 2021, Xi'an, China. ⟨10.1109/ICRA48506.2021.9561614⟩. ⟨hal-02971806⟩

Tong Chen, Jean-Bernard Lasserre, Victor Magron, Edouard Pauwels. Semialgebraic Representation of Monotone Deep Equilibrium Models and Applications to Certification. Advances in Neural Information Processing Systems, Dec 2021, Online, France. ⟨hal-03265346⟩

Pré-publications, documents de travail

Ngoc Hoang Anh Mai, Victor Magron, Jean-Bernard Lasserre. A hierarchy of spectral relaxations for polynomial optimization. 2021. ⟨hal-03149938⟩

2020

Articles dans une revue

Swann Marx, Tillmann Weisser, Didier Henrion, Jean B Lasserre. A moment approach for entropy solutions to nonlinear hyperbolic PDEs *. Mathematical Control and Related Fields, 2020, 10 (1), pp.113-140. ⟨10.3934/mcrf.2019032⟩. ⟨hal-01830870⟩

Khazhgali Kozhasov, Jean-Bernard Lasserre. NONNEGATIVE FORMS WITH SUBLEVEL SETS OF MINIMAL VOLUME. Mathematical Programming, Series A, 2020, ⟨10.1007/s10107-020-01584-0⟩. ⟨hal-02294984v2⟩

Jean-Bernard Lasserre, Victor Magron. Computing the Hausdorff boundary measure of semi-algebraic sets. SIAM Journal on Applied Algebra and Geometry, 2020, 4 (3), pp.441-469. ⟨10.1137/20M1314392⟩. ⟨hal-02448149⟩

Jean B Lasserre. Connecting optimization with spectral analysis of tri-diagonal matrices. Mathematical Programming, Series A, 2020, 190, pp.795--809. ⟨10.1007/s10107-020-01549-3⟩. ⟨hal-02190818v4⟩

Livres

Didier Henrion, Milan Korda, Jean-Bernard Lasserre. The Moment-SOS Hierarchy. World Scientific. World Scientific Publishing Europe Ltd., 4, 248p., 2020, Optimization and its Applications, 978-1-78634-853-1. ⟨10.1142/q0252⟩. ⟨hal-03009026⟩

Communications dans un congrès

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⟩

Didier Henrion, Matteo Tacchi, Carmen Cardozo, Jean B 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⟩

Rapports

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⟩

Pré-publications, documents de travail

Jie Wang, Victor Magron, Jean B Lasserre, Ngoc Hoang Anh Mai. CS-TSSOS: Correlative and term sparsity for large-scale polynomial optimization. 2020. ⟨hal-02566472⟩

2019

Articles dans une revue

Jean-Bernard Lasserre, Edouard Pauwels. The empirical Christoffel function with applications in data analysis. Advances in Computational Mathematics, 2019, 45 (3), pp.1439--1468. ⟨10.1007/s10444-019-09673-1⟩. ⟨hal-01511624⟩

Jean-Bernard Lasserre, Victor Magron. In SDP relaxations, inaccurate solvers do robust optimization. SIAM Journal on Optimization, 2019, 29 (3), pp.2128-2145. ⟨10.1137/18M1225677⟩. ⟨hal-01915976⟩

Yohann de Castro, Fabrice Gamboa, Didier Henrion, Roxana Hess, Jean-Bernard Lasserre. Approximate Optimal Designs for Multivariate Polynomial Regression. Annals of Statistics, 2019, 47 (1), pp.127-155. ⟨10.1214/18-AOS1683⟩. ⟨hal-01483490v2⟩

Simon Foucart, Jean-Bernard Lasserre. Computation of Chebyshev Polynomials for Union of Intervals. Computational Methods and Function Theory, 2019, ⟨10.1007/s40315-019-00285-w⟩. ⟨hal-02062836⟩

Jean B Lasserre, Youssouf Emin. Semidefinite Relaxations for Lebesgue and Gaussian Measures of Unions of Basic Semialgebraic Sets. Mathematics of Operations Research, 2019, 44 (4), pp.1145-1509. ⟨10.1287/moor.2018.0980⟩. ⟨hal-01543361⟩

Jean B Lasserre. VOLUME OF SUBLEVEL SETS OF HOMOGENEOUS POLYNOMIALS. SIAM Journal on Applied Algebra and Geometry, 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, 2019, 45 (3), pp.1401-1437. ⟨10.1007/s10444-019-09672-2⟩. ⟨hal-01575325v2⟩

Jean-Bernard Lasserre, Mihai Putinar. Positive Functionals and Hessenberg Matrices. Proceedings of the American Mathematical Society, 2019, 147 (3), pp.1097--1108. ⟨10.1090/proc/14266⟩. ⟨hal-01806491⟩

Communications dans un congrès

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 B 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⟩

Rapports

Dimitri Peaucelle, Marie-José Huguet, Yannick Pencolé, Christian Artigues, Emmanuel Hébrard, et al.. Bilan et prospectives 2019 du département Décision & Optimisation du LAAS-CNRS. 2019. ⟨hal-02295816⟩

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⟩

2018

Articles dans une revue

Simon Foucart, Jean-Bernard Lasserre. Determining Projection Constants of Univariate Polynomial Spaces. Journal of Approximation Theory, 2018, 235, pp.74-91. ⟨10.1016/j.jat.2018.06.002⟩. ⟨hal-01679124⟩

Jean-Bernard Lasserre, Victor Magron. Optimal data fitting: a moment approach. SIAM Journal on Optimization, 2018, 28 (4), pp.3127-3144. ⟨10.1137/18M1170108⟩. ⟨hal-01706850⟩

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, 2018, 10, pp.1--32. ⟨hal-01341931v3⟩

Communications dans un congrès

Jean B Lasserre. THE MOMENT-SOS HIERARCHY. International Congress of Mathematicians 2018 (ICM 2018), Aug 2018, Rio de Janeiro, Brazil. 21p. ⟨hal-01856182⟩

2017

Articles dans une revue

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, 2017, 110 (11), pp.1021-1048. ⟨10.1002/nme.5436⟩. ⟨hal-01426656⟩

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, 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, 2017, 1 (1), pp.50--55. ⟨10.1109/LCSYS.2017.2704295⟩. ⟨hal-01487006v2⟩

Jean-Bernard Lasserre, Toh Kim-Chuan, Yang Shouguang. A bounded degree SOS hierarchy for polynomial optimization . EURO Journal on Computational Optimization, 2017, 5 (1), pp.87--117. ⟨hal-01109125v2⟩

Jean-Bernard Lasserre. Computing gaussian & exponential measures of semi-algebraic sets. Advances in Applied Mathematics, 2017, 91, pp.137-163. ⟨hal-01185641v2⟩

Etienne de Klerk, Jean B Lasserre, Monique Laurent, Zhao Sun. Bound-Constrained Polynomial Optimization Using Only Elementary Calculations. Mathematics of Operations Research, 2017, 42 (3), pp.834 - 853. ⟨10.1287/moor.2016.0829⟩. ⟨hal-01698348⟩

Livres

Jean-Paul Laumond, Nicolas Mansard, Jean-Bernard Lasserre (Dir.). Geometric and Numerical Foundations of Movements. Springer. Springer International Publishing, 117, 2017, Springer Tracts in Advanced Robotics, Bruno Siciliano; Oussama Khatib, 978-3-319-51546-5. ⟨10.1007/978-3-319-51547-2⟩. ⟨hal-01590779⟩

Chapitres d’ouvrages

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⟩

Communications dans un congrès

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⟩

2016

Articles dans une revue

Jean-Bernard Lasserre. Lebesgue decomposition in action via semidefinite relaxations. Advances in Computational Mathematics, 2016, 42 (5), pp.1129-1148. ⟨10.1007/s10444-016-9456-1⟩. ⟨hal-01212385v2⟩

Edouard Pauwels, Didier Henrion, Jean-Bernard Lasserre. Linear conic optimization for inverse optimal control. SIAM Journal on Control and Optimization, 2016, 54 (3), pp.1798-1825. ⟨10.1137/14099454X⟩. ⟨hal-01080428v3⟩

Jean-Bernard Lasserre. CONVEX OPTIMIZATION AND PARSIMONY OF L p -BALLS REPRESENTATION *. SIAM Journal on Optimization, 2016, SIAM Journal on Optimization, 26 (1), pp.247--273. ⟨10.1137/140983082⟩. ⟨hal-01053891v3⟩

V Jeyakumar †, Jean-Bernard Lasserre, G Li, T.S Pham. CONVERGENT SEMIDEFINITE PROGRAMMING RELAXATIONS FOR GLOBAL BILEVEL POLYNOMIAL OPTIMIZATION PROBLEMS *. SIAM Journal on Optimization, 2016, 26 (1), pp.753--780. ⟨10.1137/15M1017922⟩. ⟨hal-01295159⟩

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, 2016, 39 (5), pp.1009-1021. ⟨10.2514/1.G001353⟩. ⟨hal-01132149⟩

Roxana Hess, Didier Henrion, Jean-Bernard Lasserre, Tien Son Pham. Semidefinite approximations of the polynomial abscissa. SIAM Journal on Control and Optimization, 2016, 54 (3), pp. 1633-1656. ⟨hal-01181623⟩

Jean-Bernard Lasserre. A MAX-CUT FORMULATION OF 0/1 PROGRAMS. Operations Research Letters, 2016, 44 (2), pp.158--164. ⟨hal-01154698v3⟩

Communications dans un congrès

Jean-Bernard Lasserre, Edouard Pauwels. Sorting out typicality with the inverse moment matrix SOS polynomial. 30th Conference on Neural Information Processing Systems (NIPS 2016), Dec 2016, Barcelone, Spain. pp.1-16, ⟨10.48550/arXiv.1606.03858⟩. ⟨hal-01331591⟩

2015

Articles dans une revue

Florian Bugarin, Didier Henrion, Jean-Bernard Lasserre. Minimizing the sum of many rational functions. Mathematical Programming Computation, 2015, 8 (1), pp. 83-111. ⟨10.1007/s12532-015-0089-z⟩. ⟨hal-00569067v2⟩

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, 2015, 53 (1), pp.42-60. ⟨hal-00723015v2⟩

Jean-Bernard Lasserre. A generalization of Löwner-John's ellipsoid theorem. Mathematical Programming, Series A, 2015, 152, pp.559--591. ⟨10.1007/s10107-014-0798-5⟩. ⟨hal-00785158v5⟩

Jean-Bernard Lasserre. Level sets and non Gaussian integrals of positively homogeneous functions. International Game Theory Review, 2015, 17 (1), pp.10.1142/S0219198915400010. ⟨10.1142/S0219198915400010⟩. ⟨hal-00637049v3⟩

Jean-Bernard Lasserre. Moments and Legendre-Fourier Series for Measures Supported on Curves. Symmetry, Integrability and Geometry : Methods and Applications, 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, 2015, 58 (5), pp.64-74. ⟨10.1145/2743132⟩. ⟨hal-01376752⟩

Jean-Bernard Lasserre. Volume of slices and sections of the simplex in closed form. Optimization Letters, 2015, 9 (7), pp.1263--1269. ⟨hal-01095071⟩

Eric B Chin, Jean B Lasserre, N Sukumar. Numerical integration of homogeneous functions on convex and nonconvex polygons and polyhedra. Computational Mechanics, 2015, 56, pp.967 - 981. ⟨10.1007/s00466-015-1213-7⟩. ⟨hal-01426581⟩

Jean-Bernard Lasserre, Mihai Putinar. Algebraic-exponential data recovery from moments. Discrete and Computational Geometry, 2015, 54 (5), pp.993-1012. ⟨10.1007/s00454-015-9739-1⟩. ⟨hal-00936719v2⟩

Victor Magron, Didier Henrion, Jean-Bernard Lasserre. Semidefinite approximations of projections and polynomial images of semialgebraic sets. SIAM Journal on Optimization, 2015, 25 (4), pp. 2143-2164. ⟨hal-01075343v2⟩

Livres

Jean-Bernard Lasserre. An Introduction to Polynomial and Semi-Algebraic Optimization. Cambridge University Press, 2015, 9781107447226. ⟨10.1017/CBO9781107447226⟩. ⟨hal-02095856⟩

Rapports

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⟩