An economic interpretation of exact penalty functions using sensitivity analysis. - Jean B. Lasserre (Oper. Res. Lett., 1981)

Technical Note - The Stochastic Discrete Dynamic Lot Size Problem: An Open-Loop Solution. - Jean B. Lasserre; C. Bes; François Roubellat (Oper. Res., 1985)

Generic Scheduling Polyhedra and a New Mixed-Integer Formulation for Single-Machine Scheduling. - Jean B. Lasserre; Maurice Queyranne (IPCO, 1992)

Reachable, controllable sets and stabilizing control of constrained linear systems. - Jean B. Lasserre (Autom., 1993)

Linear programming formulation of MDPs in countable state space: The multichain case. - Arie Hordijk; Jean B. Lasserre (Math. Methods Oper. Res., 1994)

A new Farkas lemma for positive semidefinite matrices. - Jean B. Lasserre (IEEE Trans. Autom. Control., 1995)

A trace inequality for matrix product. - Jean B. Lasserre (IEEE Trans. Autom. Control., 1995)

Lot Streaming in Job-Shop Scheduling. - Stéphane Dauzère-Pérès; Jean-Bernard Lasserre (Oper. Res., 1997)

Tight bounds for the trace of a matrix product. - Jean B. Lasserre (IEEE Trans. Autom. Control., 1997)

Multi-resource shop scheduling with resource flexibility. - Stéphane Dauzère-Pérès; W. Roux; Jean B. Lasserre (Eur. J. Oper. Res., 1998)

Approximation Schemes for Infinite Linear Programs. - Onésimo Hernández-Lerma; Jean B. Lasserre (SIAM J. Optim., 1998)

Sample-path average optimality for Markov control processes. - Jean-Bernard Lasserre (IEEE Trans. Autom. Control., 1999)

Analytic perturbation of Sylvester and Lyapunov matrix equations. - Konstantin E. Avrachenkov; Jean B. Lasserre (CDC, 2000)

Convergent LMI relaxations for nonconvex quadratic programs. - Jean B. Lasserre (CDC, 2000)

Why the logarithmic barrier function in convex and linear programming? - Jean B. Lasserre (Oper. Res. Lett., 2000)

Zero-Sum Stochastic Games in Borel Spaces: Average Payoff Criteria. - Onésimo Hernández-Lerma; Jean B. Lasserre (SIAM J. Control. Optim., 2000)

An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs. - Jean B. Lasserre (IPCO, 2001)

A Laplace transform algorithm for the volume of a convex polytope. - Jean B. Lasserre; Eduardo S. Zeron (J. ACM, 2001)

Global Optimization with Polynomials and the Problem of Moments. - Jean B. Lasserre (SIAM J. Optim., 2001)

A Quick Proof for the Volume of n-Balls. - Jean B. Lasserre (Am. Math. Mon., 2001)

The Multi-Dimensional Version of ∫b a xp dx. - Jean B. Lasserre; Konstantin Avrachenkov (Am. Math. Mon., 2001)

Pythagoras' Theorem for Areas. - Jean-Pierre Quadrat; Jean B. Lasserre; Jean-Baptiste Hiriart-Urruty (Am. Math. Mon., 2001)

Solving Global Optimization Problems over Polynomials with GloptiPoly 2.1. - Didier Henrion; Jean B. Lasserre (COCOS, 2002)

Semidefinite Programming vs. LP Relaxations for Polynomial Programming. - Jean B. Lasserre (Math. Oper. Res., 2002)

Solving the knapsack problem via Z-transform. - Jean B. Lasserre; Eduardo S. Zeron (Oper. Res. Lett., 2002)

An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs. - Jean B. Lasserre (SIAM J. Optim., 2002)

Analytic perturbation of Sylvester matrix equations. - Konstantin Avrachenkov; Jean B. Lasserre (IEEE Trans. Autom. Control., 2002)

Characterizing polynomials with roots in a semi-algebraic set. - Jean B. Lasserre (CDC, 2003)

On Counting Integral Points in a Convex Rational Polytope. - Jean B. Lasserre; Eduardo S. Zeron (Math. Oper. Res., 2003)

GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi. - Didier Henrion; Jean B. Lasserre (ACM Trans. Math. Softw., 2003)

On parameter-dependent Lyapunov functions for robust stability of linear systems. - Didier Henrion; Denis Arzelier; Dimitri Peaucelle; Jean-Bernard Lasserre (CDC, 2004)

The Integer Hull of a Convex Rational Polytope. - Jean B. Lasserre (Discret. Comput. Geom., 2004)

A discrete Farkas lemma. - Jean B. Lasserre (Discret. Optim., 2004)

Generating functions and duality for integer programs. - Jean B. Lasserre (Discret. Optim., 2004)

Integer programming, Barvinok's counting algorithm and Gomory relaxations. - Jean B. Lasserre (Oper. Res. Lett., 2004)

Characterizing polynomials with roots in a semialgebraic set. - Jean B. Lasserre (IEEE Trans. Autom. Control., 2004)

SOS approximation of polynomials nonnegative on an algebraic set. - Jean B. Lasserre (CDC/ECC, 2005)

Nonlinear optimal control: approximations via moments and LMI-relaxations. - Jean B. Lasserre; Christophe Prieur 001; Didier Henrion (CDC/ECC, 2005)

Erratum to "Generating functions and duality for integer programs": [Discrete Optimization 1 (2) (2004) 167-187]. - Jean B. Lasserre (Discret. Optim., 2005)

Hierarchical scheduling for decision support. - Gérard Fontan; Colette Mercé; Jean-Claude Hennet; Jean B. Lasserre (J. Intell. Manuf., 2005)

An Alternative Algorithm for Counting Lattice Points in a Convex Polytope. - Jean B. Lasserre; Eduardo S. Zeron (Math. Oper. Res., 2005)

Sum of Squares Approximation of Polynomials, Nonnegative on a Real Algebraic Set. - Jean B. Lasserre (SIAM J. Optim., 2005)

Polynomial Programming: LP-Relaxations Also Converge. - Jean B. Lasserre (SIAM J. Optim., 2005)

Robust global optimization with polynomials. - Jean B. Lasserre (Math. Program., 2006)

LMIs for constrained polynomial interpolation with application in trajectory planning. - Didier Henrion; Jean B. Lasserre (Syst. Control. Lett., 2006)

Convergent SDP-Relaxations in Polynomial Optimization with Sparsity. - Jean B. Lasserre (SIAM J. Optim., 2006)

A Sum of Squares Approximation of Nonnegative Polynomials. - Jean B. Lasserre (SIAM J. Optim., 2006)

Convergent relaxations of polynomial matrix inequalities and static output feedback. - Didier Henrion; Jean B. Lasserre (IEEE Trans. Autom. Control., 2006)

Semidefinite programming for gradient and Hessian computation in maximum entropy estimation. - Jean B. Lasserre (CDC, 2007)

Simple Explicit Formula for Counting Lattice Points of Polyhedra. - Jean B. Lasserre; Eduardo S. Zeron (IPCO, 2007)

Nonlinear optimal control synthesis via occupation measures. - Didier Henrion; Jean B. Lasserre; Carlo Savorgnan (CDC, 2008)

Computing the real variety of an ideal: a real algebraic and symbolic-numeric algorithm. - Jean B. Lasserre; Monique Laurent; Philipp Rostalski (SAC, 2008)

Semidefinite programming for N-Player Games - Rida Laraki; Jean B. Lasserre (CoRR, 2008)

Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals. - Jean B. Lasserre; Monique Laurent; Philipp Rostalski (Found. Comput. Math., 2008)

A semidefinite programming approach to the generalized problem of moments. - Jean B. Lasserre (Math. Program., 2008)

Approximating integrals of multivariate exponentials: A moment approach. - Dimitris Bertsimas; Xuan Vinh Doan; Jean B. Lasserre (Oper. Res. Lett., 2008)

Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations. - Jean B. Lasserre; Didier Henrion; Christophe Prieur 001; Emmanuel Trélat (SIAM J. Control. Optim., 2008)

Discrete-time stochastic optimal control via occupation measures and moment relaxations. - Carlo Savorgnan; Jean B. Lasserre; Moritz Diehl (CDC, 2009)

POCP: A package for polynomial optimal control problems. - Didier Henrion; Jean B. Lasserre; Carlo Savorgnan (ECC, 2009)

Certificates and relaxations for integer programming and the semi-group membership problem - Jean B. Lasserre; Eduardo S. Zeron (CoRR, 2009)

Moments and sums of squares for polynomial optimization and related problems. - Jean B. Lasserre (J. Glob. Optim., 2009)

The K-moment problem with densities. - Jean B. Lasserre (Math. Program., 2009)

Convex sets with semidefinite representation. - Jean B. Lasserre (Math. Program., 2009)

GloptiPoly 3: moments, optimization and semidefinite programming. - Didier Henrion; Jean-Bernard Lasserre; Johan Löfberg (Optim. Methods Softw., 2009)

Convexity in SemiAlgebraic Geometry and Polynomial Optimization. - Jean B. Lasserre (SIAM J. Optim., 2009)

Approximate Volume and Integration for Basic Semialgebraic Sets. - Didier Henrion; Jean B. Lasserre; Carlo Savorgnan (SIAM Rev., 2009)

A prolongation-projection algorithm for computing the finite real variety of an ideal. - Jean B. Lasserre; Monique Laurent; Philipp Rostalski (Theor. Comput. Sci., 2009)

A "joint+marginal" algorithm for polynomial optimization. - Jean B. Lasserre; Tung Phan Thanh (CDC, 2010)

Certificates of convexity for basic semi-algebraic sets. - Jean B. Lasserre (Appl. Math. Lett., 2010)

On representations of the feasible set in convex optimization. - Jean B. Lasserre (Optim. Lett., 2010)

A "Joint+Marginal" Approach to Parametric Polynomial Optimization. - Jean B. Lasserre (SIAM J. Optim., 2010)

Positivity and Optimization for Semi-Algebraic Functions. - Jean B. Lasserre; Mihai Putinar (SIAM J. Optim., 2010)

Min-max and robust polynomial optimization. - Jean B. Lasserre (J. Glob. Optim., 2011)

On convex optimization without convex representation. - Jean B. Lasserre (Optim. Lett., 2011)

A New Look at Nonnegativity on Closed Sets and Polynomial Optimization. - Jean B. Lasserre (SIAM J. Optim., 2011)

Modern Optimization Modelling Techniques. - Roberto Cominetti; Francisco Facchinei; Jean B. Lasserre (Birkhäuser, 2012)

Measures and LMI for impulsive optimal control with applications to space rendezvous problems. - Mathieu Claeys; Denis Arzelier; Didier Henrion; Jean-Bernard Lasserre (ACC, 2012)

The Inverse Moment Problem for Convex Polytopes. - Nick Gravin; Jean B. Lasserre; Dmitrii V. Pasechnik; Sinai Robins (Discret. Comput. Geom., 2012)

The existence of Gaussian cubature formulas. - Jean B. Lasserre (J. Approx. Theory, 2012)

A "joint + marginal" heuristic for 0/1 programs. - Jean B. Lasserre; Tung Phan Thanh (J. Glob. Optim., 2012)

Semidefinite programming for min-max problems and games. - Rida Laraki; Jean B. Lasserre (Math. Program., 2012)

Inner Approximations for Polynomial Matrix Inequalities and Robust Stability Regions. - Didier Henrion; Jean B. Lasserre (IEEE Trans. Autom. Control., 2012)

Moment LMI approach to LTV impulsive control. - Mathieu Claeys; Denis Arzelier; Didier Henrion; Jean-Bernard Lasserre (CDC, 2013)

Recovering an Homogeneous Polynomial from Moments of Its Level Set. - Jean B. Lasserre (Discret. Comput. Geom., 2013)

Convex underestimators of polynomials. - Jean B. Lasserre; Tung Phan Thanh (J. Glob. Optim., 2013)

Moment matrices, border bases and real radical computation. - Jean-Bernard Lasserre; Monique Laurent; Bernard Mourrain; Philipp Rostalski; Philippe Trebuchet (J. Symb. Comput., 2013)

Inverse Polynomial Optimization. - Jean B. Lasserre (Math. Oper. Res., 2013)

Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization. - Cordian Riener; Thorsten Theobald; Lina Jansson Andrén; Jean B. Lasserre (Math. Oper. Res., 2013)

A Lagrangian Relaxation View of Linear and Semidefinite Hierarchies. - Jean B. Lasserre (SIAM J. Optim., 2013)

Inverse optimal control with polynomial optimization. - Edouard Pauwels; Didier Henrion; Jean-Bernard Lasserre (CDC, 2014)

Optimality in robot motion: optimal versus optimized motion. - Jean-Paul Laumond; Nicolas Mansard; Jean-Bernard Lasserre (Commun. ACM, 2014)

Lower bounds on the global minimum of a polynomial. - Mehdi Ghasemi 002; Jean B. Lasserre; M. Marshall (Comput. Optim. Appl., 2014)

On Polynomial Optimization Over Non-compact Semi-algebraic Sets. - Vaithilingam Jeyakumar; Jean B. Lasserre; Guoyin Li 001 (J. Optim. Theory Appl., 2014)

New approximations for the cone of copositive matrices and its dual. - Jean B. Lasserre (Math. Program., 2014)

Erratum to: On convex optimization without convex representation. - Jean B. Lasserre (Optim. Lett., 2014)

Approximating Pareto curves using semidefinite relaxations. - Victor Magron; Didier Henrion; Jean-Bernard Lasserre (Oper. Res. Lett., 2014)

A Unified Framework for Solving a General Class of Conditional and Robust Set-Membership Estimation Problems. - Vito Cerone; Jean-Bernard Lasserre; Dario Piga; Diego Regruto (IEEE Trans. Autom. Control., 2014)

Measures and LMIs for Impulsive Nonlinear Optimal Control. - Mathieu Claeys; Denis Arzelier; Didier Henrion; Jean-Bernard Lasserre (IEEE Trans. Autom. Control., 2014)

Optimization as motion selection principle in robot action. - Jean-Paul Laumond; Nicolas Mansard; Jean-Bernard Lasserre (Commun. ACM, 2015)

Algebraic-exponential Data Recovery from Moments. - Jean-Bernard Lasserre; Mihai Putinar (Discret. Comput. Geom., 2015)

Level Sets and NonGaussian Integrals of Positively Homogeneous Functions. - Jean B. Lasserre (IGTR, 2015)

Rank-Constrained Fundamental Matrix Estimation by Polynomial Global Optimization Versus the Eight-Point Algorithm. - Florian Bugarin; Adrien Bartoli; Didier Henrion; Jean-Bernard Lasserre; Jean-José Orteu; Thierry Sentenac (J. Math. Imaging Vis., 2015)

Tractable approximations of sets defined with quantifiers. - Jean B. Lasserre (Math. Program., 2015)

A generalization of Löwner-John's ellipsoid theorem. - Jean B. Lasserre (Math. Program., 2015)

The 2013 Newton Institute Programme on polynomial optimization. - Adam N. Letchford; Jean B. Lasserre; Pablo A. Parrilo; David Steurer (Math. Program., 2015)

Volume of slices and sections of the simplex in closed form. - Jean B. Lasserre (Optim. Lett., 2015)

Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets. - Victor Magron; Didier Henrion; Jean-Bernard Lasserre (SIAM J. Optim., 2015)

Sorting out typicality with the inverse moment matrix SOS polynomial. - Edouard Pauwels; Jean B. Lasserre (NIPS, 2016)

Lebesgue decomposition in action via semidefinite relaxations. - Jean B. Lasserre (Adv. Comput. Math., 2016)

Minimizing the sum of many rational functions. - Florian Bugarin; Didier Henrion; Jean-Bernard Lasserre (Math. Program. Comput., 2016)

A MAX-CUT formulation of 0/1 programs. - Jean B. Lasserre (Oper. Res. Lett., 2016)

Semidefinite Approximations of the Polynomial Abscissa. - Roxana Heß; Didier Henrion; Jean-Bernard Lasserre; Tien Son Pham (SIAM J. Control. Optim., 2016)

Linear Conic Optimization for Inverse Optimal Control. - Edouard Pauwels; Didier Henrion; Jean-Bernard Lasserre (SIAM J. Control. Optim., 2016)

Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems. - Vaithilingam Jeyakumar; Jean B. Lasserre; Guoyin Li 001; T. S. Pham (SIAM J. Optim., 2016)

Convex Optimization and Parsimony of Lp-balls Representation. - Jean B. Lasserre (SIAM J. Optim., 2016)

On inverse optimal control via polynomial optimization. - Jérémy Rouot; Jean-Bernard Lasserre (CDC, 2017)

Computing Gaussian & exponential measures of semi-algebraic sets. - Jean B. Lasserre (Adv. Appl. Math., 2017)

Approximate Optimal Designs for Multivariate Polynomial Regression. - Yohann de Castro; Fabrice Gamboa; Didier Henrion; Roxana Hess; Jean-Bernard Lasserre (CoRR, 2017)

The empirical Christoffel function in Statistics and Machine Learning. - Jean-Bernard Lasserre; Edouard Pauwels (CoRR, 2017)

Representation of Chance-Constraints With Strong Asymptotic Guarantees. - Jean B. Lasserre (IEEE Control. Syst. Lett., 2017)

A bounded degree SOS hierarchy for polynomial optimization. - Jean B. Lasserre; Kim-Chuan Toh; Shouguang Yang (EURO J. Comput. Optim., 2017)

Bound-Constrained Polynomial Optimization Using Only Elementary Calculations. - Etienne de Klerk; Jean B. Lasserre; Monique Laurent; Zhao Sun (Math. Oper. Res., 2017)

Exact Solutions to Super Resolution on Semi-Algebraic Domains in Higher Dimensions. - Yohann de Castro; Fabrice Gamboa; Didier Henrion; Jean B. Lasserre (IEEE Trans. Inf. Theory, 2017)

Positivity Certificates in Optimal Control. - Edouard Pauwels; Didier Henrion; Jean-Bernard Lasserre (Geometric and Numerical Foundations of Movements, 2017)

Determining projection constants of univariate polynomial spaces. - Simon Foucart; Jean B. Lasserre (J. Approx. Theory, 2018)

Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity. - Tillmann Weißer; Jean B. Lasserre; Kim-Chuan Toh (Math. Program. Comput., 2018)

Optimal Data Fitting: A Moment Approach. - Jean-Bernard Lasserre; Victor Magron (SIAM J. Optim., 2018)

Volume of sub-level sets of polynomials. - Jean B. Lasserre (ECC, 2019)

On Moment Problems with Holonomic Functions. - Florent Bréhard; Mioara Joldes; Jean-Bernard Lasserre (ISSAC, 2019)

Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony? - Cédric Josz; Jean-Bernard Lasserre; Bernard Mourrain (Adv. Comput. Math., 2019)

The empirical Christoffel function with applications in data analysis. - Jean B. Lasserre; Edouard Pauwels (Adv. Comput. Math., 2019)

Simple formula for integration of polynomials on a simplex. - Jean B. Lasserre (CoRR, 2019)

Approximating regions of attraction of a sparse polynomial differential system. - Matteo Tacchi 001; Carmen Cardozo; Didier Henrion; Jean B. Lasserre (CoRR, 2019)

Semidefinite Relaxations for Lebesgue and Gaussian Measures of Unions of Basic Semialgebraic Sets. - Jean B. Lasserre; Youssouf Emin (Math. Oper. Res., 2019)

Volume of Sublevel Sets of Homogeneous Polynomials. - Jean B. Lasserre (SIAM J. Appl. Algebra Geom., 2019)

In SDP Relaxations, Inaccurate Solvers Do Robust Optimization. - Jean-Bernard Lasserre; Victor Magron (SIAM J. Optim., 2019)

Semialgebraic Optimization for Lipschitz Constants of ReLU Networks. - Tong Chen 002; Jean B. Lasserre; Victor Magron; Edouard Pauwels (NeurIPS, 2020)

Polynomial Optimization for Bounding Lipschitz Constants of Deep Networks. - Tong Chen 002; Jean-Bernard Lasserre; Victor Magron; Edouard Pauwels (CoRR, 2020)

Computing the Hausdorff Boundary Measure of Semialgebraic Sets. - Jean B. Lasserre; Victor Magron (SIAM J. Appl. Algebra Geom., 2020)

Polynomial superlevel set approximation of swept-volume for computing collision probability in space encounters. - Denis Arzelier; Florent Bréhard; Mioara Joldes; Jean B. Lasserre; S. Laurens; Aude Rondepierre (CDC, 2021)

Piecewise-Linear Motion Planning amidst Static, Moving, or Morphing Obstacles. - Bachir El Khadir; Jean-Bernard Lasserre; Vikas Sindhwani (ICRA, 2021)

Semialgebraic Representation of Monotone Deep Equilibrium Models and Applications to Certification. - Tong Chen 002; Jean B. Lasserre; Victor Magron; Edouard Pauwels (NeurIPS, 2021)

Data Analysis from Empirical Moments and the Christoffel Function. - Edouard Pauwels; Mihai Putinar; Jean-Bernard Lasserre (Found. Comput. Math., 2021)

Connecting optimization with spectral analysis of tri-diagonal matrices. - Jean B. Lasserre (Math. Program., 2021)

Distributionally robust polynomial chance-constraints under mixture ambiguity sets. - Jean B. Lasserre; Tillmann Weißer (Math. Program., 2021)

Dual optimal design and the Christoffel-Darboux polynomial. - Yohann de Castro; Fabrice Gamboa; Didier Henrion; Jean-Bernard Lasserre (Optim. Lett., 2021)

The moment-SOS hierarchy and the Christoffel-Darboux kernel. - Jean B. Lasserre (Optim. Lett., 2021)

Minimizing Rational Functions: A Hierarchy of Approximations via Pushforward Measures. - Jean-Bernard Lasserre; Victor Magron; Swann Marx; Olivier Zahm (SIAM J. Optim., 2021)

TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity. - Jie Wang 037; Victor Magron; Jean-Bernard Lasserre (SIAM J. Optim., 2021)

Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension. - Jie Wang 037; Victor Magron; Jean-Bernard Lasserre (SIAM J. Optim., 2021)

A sublevel moment-SOS hierarchy for polynomial optimization. - Tong Chen 002; Jean-Bernard Lasserre; Victor Magron; Edouard Pauwels (Comput. Optim. Appl., 2022)

Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant. - Ngoc Hoang Anh Mai; Victor Magron; Jean-Bernard Lasserre; Kim-Chuan Toh (CoRR, 2022)

Exploiting Sparsity for Semi-Algebraic Set Volume Computation. - Matteo Tacchi 001; Tillmann Weißer; Jean-Bernard Lasserre; Didier Henrion (Found. Comput. Math., 2022)

Special Issue: Polynomial and Tensor Optimization. - Shmuel Friedland; Jean-Bernard Lasserre; Lek-Heng Lim; Jiawang Nie (Math. Program., 2022)

Nonnegative forms with sublevel sets of minimal volume. - Khazhgali Kozhasov; Jean-Bernard Lasserre (Math. Program., 2022)

Positivity certificates and polynomial optimization on non-compact semialgebraic sets. - Ngoc Hoang Anh Mai; Jean-Bernard Lasserre; Victor Magron (Math. Program., 2022)

Homogeneous polynomials and spurious local minima on the unit sphere. - Jean B. Lasserre (Optim. Lett., 2022)

Optimization on the Euclidean Unit Sphere. - Jean B. Lasserre (SIAM J. Optim., 2022)

Exploiting Constant Trace Property in Large-scale Polynomial Optimization. - Ngoc Hoang Anh Mai; Jean B. Lasserre; Victor Magron; Jie Wang 037 (ACM Trans. Math. Softw., 2022)

CS-TSSOS: Correlative and Term Sparsity for Large-Scale Polynomial Optimization. - Jie Wang 037; Victor Magron; Jean B. Lasserre; Ngoc Hoang Anh Mai (ACM Trans. Math. Softw., 2022)

Polynomial argmin for recovery and approximation of multivariate discontinuous functions. - Didier Henrion; Milan Korda; Jean-Bernard Lasserre (CoRR, 2023)

Stokes, Gibbs, and Volume Computation of Semi-Algebraic Sets. - Matteo Tacchi 001; Jean-Bernard Lasserre; Didier Henrion (Discret. Comput. Geom., 2023)

Revisiting Semidefinite Programming Approaches to Options Pricing: Complexity and Computational Perspectives. - Didier Henrion; Felix Kirschner; Etienne de Klerk; Milan Korda; Jean-Bernard Lasserre; Victor Magron (INFORMS J. Comput., 2023)

A Sparse Version of Reznick's Positivstellensatz. - Ngoc Hoang Anh Mai; Victor Magron; Jean B. Lasserre (Math. Oper. Res., 2023)

A modified Christoffel function and its asymptotic properties. - Jean B. Lasserre (J. Approx. Theory, 2023)

A hierarchy of spectral relaxations for polynomial optimization. - Ngoc Hoang Anh Mai; Jean-Bernard Lasserre; Victor Magron (Math. Program. Comput., 2023)

Volumes of Sublevel Sets of Nonnegative Forms and Complete Monotonicity. - Khazhgali Kozhasov; Jean B. Lasserre (SIAM J. Appl. Algebra Geom., 2023)

Uncertainty quantification of set-membership estimation in control and perception: Revisiting the minimum enclosing ellipsoid. - Yukai Tang; Jean-Bernard Lasserre; Heng Yang (L4DC, 2024)

The Moment-SOS hierarchy: Applications and related topics. - Jean B. Lasserre (Acta Numer., 2024)

Verifying Properties of Binary Neural Networks Using Sparse Polynomial Optimization. - Jianting Yang; Srecko Ðurasinovic; Jean B. Lasserre; Victor Magron; Jun Zhao (ICLR, 2025)

A Laplace Duality for Integration. - Jean B. Lasserre (IEEE Control. Syst. Lett., 2025)

Optimization-aided construction of multivariate Chebyshev polynomials. - Mareike Dressler; Simon Foucart; Mioara Joldes; Etienne de Klerk; Jean B. Lasserre; Yuan Xu (J. Approx. Theory, 2025)

Leveraging the Christoffel function for outlier detection in data streams. - Kévin Ducharlet; Louise Travé-Massuyès; Jean-Bernard Lasserre; Marie-Véronique Le Lann; Youssef Miloudi (Int. J. Data Sci. Anal., 2025)