J. Lasserre

发表

Further topics on discrete-time Markov control processes

O. Hernández-Lerma, J. Lasserre, 1999 .

Error bounds for rolling horizon policies in discrete-time Markov control processes

O. Hernández-Lerma, J. Lasserre, 1990 .

Markov chains and invariant probabilities

O. Hernández-Lerma, J. Lasserre, 2003 .

Discrete-time Markov control processes

O. Hernández-Lerma, J. Lasserre, 1999 .

A new Farkas lemma for positive semidefinite matrices

J. Lasserre, 1995, IEEE Trans. Autom. Control..

Bounds on measures satisfying moment conditions

J. Lasserre, 2002 .

Handbook on Semidefinite, Conic and Polynomial Optimization

J. Lasserre, M. Anjos, 2012 .

Average cost optimal policies for Markov control processes with Borel state space and unbounded costs

O. Hernández-Lerma, J. Lasserre, 1990 .

Moments, Positive Polynomials And Their Applications

J. Lasserre, 2009 .

Average cost Markov Decision Processes: Optimality conditions☆

O. Hernández-Lerma, J. Lasserre, J. Hennet, 1991 .

Linear programming with positive semi-definite matrices

J. Lasserre, 1996 .

A Farkas lemma Without A Standard Closure Condition

J. Lasserre, 1997 .

Linear programming with positive semi definite matrices

J. Lasserre, 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.

New Positive Semidefinite Relaxations for Nonconvex Quadratic Programs

J. Lasserre, 2001 .

SIAM Journal on Optimization

Nicholas I. M. Gould, Stefan Ulbrich, Masao Fukushima, 2012 .

A trace inequality for matrix product

J. Lasserre, 1995, IEEE Trans. Autom. Control..

On parameter-dependent Lyapunov functions for robust stability of linear systems

J. Lasserre, D. Henrion, D. Peaucelle, 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

Linear Programming Approximations for Markov Control Processes in Metric Spaces

O. Hernández-Lerma, J. Lasserre, 1997 .

Convexity in SemiAlgebraic Geometry and Polynomial Optimization

Jean B. Lasserre, J. Lasserre, 2008, SIAM J. Optim..

Representation of nonnegative convex polynomials

J. Lasserre, 2008, 0801.3754.

Denumerable state nonhomogeneous Markov decision processes

J. C. Bean, Robert L. Smith, J. Lasserre, 1990 .

Title: Moments, Sums of Squares and Semidefinite Programming

J. Lasserre, 2008 .

A non-standard branch and bound method for the Hamiltonian cycle problem

J. Filar, J. Lasserre, 2000 .

Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations

Emmanuel Trélat, Didier Henrion, Christophe Prieur, 2007, SIAM J. Control. Optim..

Nonlinear optimal control: Numerical approximations via moments and LMI-relaxations

J. Lasserre, D. Henrion, C. Prieur, 2005 .

Solving nonconvex optimization problems

J. Lasserre, D. Henrion, J. Lasserre, 2004, IEEE Control Systems.

SDP vs. LP Relaxations for the Moment Approach in Some Performance Evaluation Problems

J. Lasserre, T. Prieto-Rumeau, 2004 .

PRICING A CLASS OF EXOTIC OPTIONS VIA MOMENTS AND SDP RELAXATIONS

J. Lasserre, T. Prieto-Rumeau, M. Zervos, 2006 .

Global Optimization with Polynomials and the Problem of Moments

Jean B. Lasserre, J. Lasserre, 2000, SIAM J. Optim..

Construction of Positively Invariant Polytopes for Stable Linear Systems

J. Lasserre, J. Hennet, 1993 .

Optimality in robot motion

Nicolas Mansard, Jean-Paul Laumond, Jean B. Lasserre, 2014, Commun. ACM.

An Introduction to Polynomial and Semi-Algebraic Optimization

J. Lasserre, 2015 .

Linear Programming and Average Optimality of Markov Control Processes on Borel Spaces---Unbounded Costs

O. Hernández-Lerma, J. Lasserre, 1994 .

Average Optimal Stationary Policies and Linear Programming in Countable Space Markov Decision Processes

J. Lasserre, 1994 .

Linear and Integer Programming Vs Linear Integration and Counting: A Duality Viewpoint

J. Lasserre, 2008 .

Representation of distributionally robust chance-constraints

J. Lasserre, T. Weißer, T. Weisser, 2018 .

An Integrated Approach in Production Planning and Scheduling

Stéphane Dauzère-Pérès, Jean-Bernard Lasserre, J. Lasserre, 1994 .

Semidefinite Programming vs. LP Relaxations for Polynomial Programming

Jean B. Lasserre, J. Lasserre, 2002, Math. Oper. Res..

A moment approach to analyze zeros of triangular polynomial sets

J. Lasserre, 2005 .

Reachable and controllable sets for two-dimensional, linear, discrete-time systems

J. Lasserre, 1991 .

Policy Iteration for Average Cost Markov Control Processes on Borel Spaces

O. Hernández-Lerma, J. Lasserre, 1997 .

A forecast horizon and a stopping rule for general Markov decision processes

O. Hernández-Lerma, J. Lasserre, 1988 .

An analytical expression and an algorithm for the volume of a convex polyhedron inRn

Jean B. Lasserre, J. Lasserre, 1983 .

Fast and Accurate Computation of Orbital Collision Probability for Short-Term Encounters

Aude Rondepierre, Denis Arzelier, Bruno Salvy, 2016 .

Convergent LMI relaxations for non-convex optimization over polynomials in control

J. Lasserre, D. Henrion, 2004 .

Detecting global optimality and extracting solutions in GloptiPoly

J. Lasserre, D. Henrion, 2003 .

A property of certain multistage linear programs and some applications

J. Lasserre, 1981 .

New tests of optimality in Markov decision processes

J. Lasserre, 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

A new policy iteration scheme for Markov decision processes using Schweitzer's formula

J. Lasserre, 1994, Journal of Applied Probability.

Semi-algebraic Approximation Using Christoffel–Darboux Kernel

J. Lasserre, D. Henrion, Edouard Pauwels, 2019, Constructive Approximation.

Tractable semi-algebraic approximation using Christoffel-Darboux kernel

J. Lasserre, D. Henrion, Edouard Pauwels, 2019, 1904.01833.

A Sum of Squares Approximation of Nonnegative Polynomials

J. Lasserre, 2004, SIAM Journal on Optimization.

Infinite horizon nonstationary stochastic optimal control problem: A planning horizon result

J. Lasserre, C. Bès, 1984 .

An on-line procedure in discounted infinite-horizon stochastic optimal control

J. Lasserre, J. Lasserre, C. Bès, 1986 .

On the importance of sequencing decisions in production planning and scheduling

Stéphane Dauzère-Pérès, Jean-Bernard Lasserre, J. Lasserre, 2002 .

Mean Squared Error Minimization for Inverse Moment Problems

Didier Henrion, Martin Mevissen, J. Lasserre, 2012 .

Modeling crack discontinuities without element‐partitioning in the extended finite element method

Jean B. Lasserre, N. Sukumar, Eric B. Chin, 2017 .

SOS approximation of polynomials nonnegative on an algebraic set

J. Lasserre, J.B. Lasserre, 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

S.o.s. approximation of polynomials nonnegative on a real algebraic set

Jean B. Lasserre, J. Lasserre, 2004 .

Stokes, Gibbs and volume computation of semi-algebraic sets

J. Lasserre, D. Henrion, M. Tacchi, 2020, 2009.12139.

Computation of Chebyshev Polynomials for Union of Intervals

S. Foucart, J. Lasserre, 2019, Computational Methods and Function Theory.

Sparse polynomial interpolation: compressed sensing, super resolution, or Prony?

Bernard Mourrain, Jean B. Lasserre, Cédric Josz, 2017 .

The Linear Programming Approach

Onésimo Hernández-Lerma, Jean B. Lasserre, O. Hernández-Lerma, 2002 .

Moments and convex optimization for analysis and control of nonlinear partial differential equations

J. Lasserre, Milan Korda, D. Henrion, 2018, 1804.07565.

Exploiting Constant Trace Property in Large-scale Polynomial Optimization

J. Lasserre, V. Magron, N. Mai, 2020, ACM Trans. Math. Softw..

ON THE SETWISE CONVERGENCE OF SEQUENCES OF MEASURES

Jean B. Lasserre, J. Lasserre, 1997 .

Lp-Norms, Log-Barriers and Cramer Transform in Optimization

J. Lasserre, E. Zeron, 2010, 1001.1208.

Semidefinite characterization and computation of real radical ideals

P. Rostalski, J. Lasserre, M. Laurent, 2006 .

Geometric and Numerical Foundations of Movements 123

J. Lasserre, J. Laumond, N. Mansard, 2017 .

Analytic perturbation of Sylvester and Lyapunov matrixequationsKonstantin

J. Lasserre, E. Avrachenkov, 2007 .

Analytic perturbation of Sylvester and Lyapunov matrix equations

K. Avrachenkov, J. Lasserre, Konstantin Avrachenkov, 2000, Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187).

A Power Series Expansion based Method to compute the Probability of Collision for Short-term Space Encounters

J. Lasserre, B. Salvy, D. Arzelier, 2015 .

Existence of solutions to the Poisson equation in L/sub p/ spaces

O. Hernández-Lerma, J. Lasserre, 1996, Proceedings of 35th IEEE Conference on Decision and Control.

Nonnegative forms with sublevel sets of minimal volume

J. Lasserre, Khazhgali Kozhasov, 2019, Mathematical programming.

A UNIFIED METHODOLOGY FOR REAL AND COMPLEX ZEROS OF ZERO-DIMENSIONAL IDEALS

J. Lasserre, M. Laurent, 2007 .

D-OPTIMAL DESIGN FOR MULTIVARIATE POLYNOMIAL REGRESSION VIA THE CHRISTOFFEL FUNCTION AND SEMIDEFINITE RELAXATIONS

J. Lasserre, D. Henrion, F. Gamboa, 2017, 1703.01777.

Moment and SDP relaxation techniques for smooth approximations of nonlinear differential equations

J. Lasserre, D. Henrion, M. Mevissen, 2010 .

The existence of Gaussian cubature formulas

JEAN B. LASSERRE, J. Lasserre, 2011, Journal of Approximation Theory.

New capacity sets for the hedging point strategy

J. Lasserre, 1992 .

Value iteration and rolling plans for Markov control processes with unbounded rewards

O. Hernández-Lerma, J. Lasserre, J. Lasserre, 1990, 29th IEEE Conference on Decision and Control.

Bounding the support of a measure from its marginal moments

J. Lasserre, 2010, 1011.0138.

Sums of Squares Optimization via Semidefinite Programming

J. Lasserre, 2004 .

Cone-Constrained Linear Equations in Banach Spaces

O. Hernández-Lerma, J. Lasserre, 2022 .

Average Optimality in Markov Control Processes via Discounted-CostProblems and Linear Programming

Onésimo Hernández-Lerma, Jean B. Lasserre, O. Hernández-Lerma, 1996 .

FATOU'S LEMMA AND LEBESGUE'S CONVERGENCE

J. Lasserre, Theorem For Measures, 2000 .

Semidefinite approximations of the polynomial abscissa 0

J. Lasserre, D. Henrion, R. Hess, 2015 .

Detecting optimal and non-optimal actions in average-cost Markov decision processes

Jean B. Lasserre, J. Lasserre, 1994 .

Reconstruction of algebraic-exponential data from moments

J. Lasserre, M. Putinar, 2014, 1401.6831.

Measures and LMI for impulsive optimal control with applications to orbital rendezvous problems

J. Lasserre, D. Henrion, D. Arzelier, 2012 .

THE FUNDAMENTAL MATRIX OF SINGULARLY

K. Avrachenkov, J. Lasserre, Konstantin Avrachenkov, 1999 .

Strong 1-optimal stationary policies in denumerable Markov decision processes

J. Lasserre, R. Cavazos-Cadena, J. Lasserre, 1988 .

APPROXIMATE OPTIMAL DESIGNS FOR MULTIVARIATE POLYNOMIAL REGRESSION By Yohann

J. Lasserre, D. Henrion, F. Gamboa, 2018 .

S.o.s. approximation of polynomials nonnegative on a real algebraic set

J. Lasserre, 2004, math/0412400.

Detecting optimal and non-optimal actions in average-cost Markov decision processes

J. Lasserre, 1994, Journal of Applied Probability.

Perturbation Analysis of Reduced Resolvents and Generalized Inverses

J. Lasserre, E. Avrachenkov, 2001 .

Urysohn in action: separating semialgebraic sets by polynomials

J. Lasserre, Milan Korda, A. Lazarev, 2022, 2207.00570.

Revisiting Semidefinite Programming Approaches to Options Pricing: Complexity and Computational Perspectives

J. Lasserre, E. D. Klerk, Milan Korda, 2021, INFORMS Journal on Computing.

A new policy iteration scheme for Markov decision processes using Schweitzer's formula

J. Lasserre, 1994, Journal of Applied Probability.

Certifying global optimality of AC-OPF solutions via sparse polynomial optimization

J. Lasserre, Jie Wang, Victor Magron, 2021, Electric Power Systems Research.

Correction Bounds on measures satisfying moment conditions

J. Lasserre, 2004, math/0407134.

Average optimal stationary policies and linear programming in countable space Markov decision processes

J. Lasserre, 1992, [1992] Proceedings of the 31st IEEE Conference on Decision and Control.

Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals

J. Lasserre, M. Laurent, P. Rostalski, 2006, Found. Comput. Math..

Invariant probabilities for Markov chains on a metric space

Jean B. Lasserre, J. Lasserre, 1997 .

Preface: The 2013 Newton Institute programme on polynomial optimisation

Pablo A. Parrilo, David Steurer, Adam N. Letchford, 2015 .

A Positivstellensatz which Preserves the Coupling Pattern of Variables

J. Lasserre, 2006, math/0609529.

MEASURES WITH ZEROS IN THE INVERSE OF THEIR MOMENT MATRIX

J. Lasserre, J. Helton, M. Putinar, 2007, math/0702314.

The empirical Christoffel function with applications in data analysis

J. Lasserre, Edouard Pauwels, 2019, Advances in Computational Mathematics.

Semidefinite programming for min–max problems and games

J. Lasserre, R. Laraki, 2010, Mathematical programming.

A generalization of Löwner-John’s ellipsoid theorem

J. Lasserre, 2014, Mathematical Programming.

New approximations for the cone of copositive matrices and its dual

J. Lasserre, 2013, Mathematical Programming.

Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony?

B. Mourrain, J. Lasserre, C. Josz, 2019, Advances in Computational Mathematics.

Data Analysis from Empirical Moments and the Christoffel Function

J. Lasserre, Edouard Pauwels, M. Putinar, 2020, Foundations of Computational Mathematics.

On the Christoffel function and classification in data analysis

J. Lasserre, 2022, Comptes Rendus. Mathématique.

Generic Scheduling Polyhedra and a New Mixed-Integer Formulation for Single-Machine Scheduling

Maurice Queyranne, Jean B. Lasserre, J. Lasserre, 1992, IPCO.

A formula for singular perturbations of Markov chains

J. Lasserre, 1994, Journal of Applied Probability.

Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant

J. Lasserre, K. Toh, N. Mai, 2022, ArXiv.

Connecting optimization with spectral analysis of tri-diagonal matrices

J. Lasserre, 2020, Mathematical Programming.

Semidenite Programming Characterization and Computation of Real Radical Ideals MEGA 2011

J. Lasserre, M. Laurent, P. Rostalski, 2011 .

Non-negative forms, volumes of sublevel sets, complete monotonicity and moment matrices

J. Lasserre, Khazhgali Kozhasov, 2022, 2206.05170.

Measures and LMI for impulsive optimal control with applications to space rendezvous problems

J. Lasserre, D. Henrion, D. Arzelier, 2011, 2012 American Control Conference (ACC).

A sublevel moment-SOS hierarchy for polynomial optimization

J. Lasserre, Edouard Pauwels, Victor Magron, 2021, Computational Optimization and Applications.

Lebesgue decomposition in action via semidefinite relaxations

J. Lasserre, 2016, Advances in Computational Mathematics.

Algebraic–exponential Data Recovery from Moments

J. Lasserre, M. Putinar, 2015, Discrete & Computational Geometry.

SOS approximations of nonnegative polynomials via simple high degree perturbations

J. Lasserre, Tim Netzer, 2005, math/0510456.

Pell's equation, sum-of-squares and equilibrium measures of a compact set

J. Lasserre, 2022, 2210.07608.

Detecting planning horizons for deterministic infinite horizon optimal control problems

J. Lasserre, 1984, The 23rd IEEE Conference on Decision and Control.

A Sum of Squares Approximation of Nonnegative Polynomials

J. Lasserre, 2004, SIAM J. Optim..

Recovering an Homogeneous Polynomial from Moments of Its Level Set

J. Lasserre, 2012, Discret. Comput. Geom..

Dual optimal design and the Christoffel–Darboux polynomial

J. Lasserre, D. Henrion, F. Gamboa, 2020, Optim. Lett..

Approximate Optimal Designs for Multivariate Polynomial Regression pdf

Didier Henrion, Jean B. Lasserre, Yohann de Castro, 2017, The Annals of Statistics.

An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs

Jean B. Lasserre, J. Lasserre, 2001, IPCO.

Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity

Jean B. Lasserre, Tillmann Weisser, Kim-Chuan Toh, 2016, Mathematical Programming Computation.

A bounded degree SOS hierarchy for polynomial optimization

Jean B. Lasserre, Kim-Chuan Toh, Shouguang Yang, 2015, EURO J. Comput. Optim..

A Lagrangian relaxation view of linear and semidefinite hierarchies

Jean B. Lasserre, J. Lasserre, 2012, 52nd IEEE Conference on Decision and Control.

Moments and sums of squares for polynomial optimization and related problems

Jean B. Lasserre, J. Lasserre, 2009, J. Glob. Optim..

Unit balls of constant volume: which one has optimal representation?

Jean-Bernard Lasserre, J. Lasserre, 2014, 1408.1324.

A generalization of Löwner-John’s ellipsoid theorem

Jean B. Lasserre, J. Lasserre, 2013, Mathematical Programming.

Linear Conic Optimization for Inverse Optimal Control

Didier Henrion, Jean B. Lasserre, Edouard Pauwels, 2014, SIAM J. Control. Optim..

Multivariate moment matrices with zeros in their inverse

J. Lasserre, J. Helton, M. Putinar, 2007 .

Convergent SDP-Relaxations in Polynomial Optimization with Sparsity

Jean B. Lasserre, J. Lasserre, 2006, SIAM J. Optim..

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

Jean B. Lasserre, J. Lasserre, 2002, SIAM J. Optim..

Further criteria for positive Harris recurrence of Markov chains

Onésimo Hernández-Lerma, Jean B. Lasserre, O. Hernández-Lerma, 2000 .

A unified approach to computing real and complex zeros of zero-dimensional ideals

Monique Laurent, Jean B. Lasserre, Philipp Rostalski, 2009 .

Numerical integration of homogeneous functions on convex and nonconvex polygons and polyhedra

Jean B. Lasserre, N. Sukumar, Eric B. Chin, 2015, Computational Mechanics.

Positivity Certificates in Optimal Control

Didier Henrion, Edouard Pauwels, Jean-Bernard Lasserre, 2016, Geometric and Numerical Foundations of Movements.

Inverse optimal control with polynomial optimization

Didier Henrion, Jean B. Lasserre, Edouard Pauwels, 2014, 53rd IEEE Conference on Decision and Control.

Moment LMI approach to LTV impulsive control

Denis Arzelier, Didier Henrion, Jean B. Lasserre, 2013, 52nd IEEE Conference on Decision and Control.

Data Analysis from Empirical Moments and the Christoffel Function

Edouard Pauwels, Jean-Bernard Lasserre, Mihai Putinar, 2018, Foundations of Computational Mathematics.

The Integer Hull of a Convex Rational Polytope

Jean B. Lasserre, J. Lasserre, 2003, ICCSA.

Semidefinite programming for N-Player Games pdf

Rida Laraki, Jean B. Lasserre, J. Lasserre, 2008, ArXiv.

Graph Recovery from Incomplete Moment Information

J. Lasserre, D. Henrion, 2020, Constructive Approximation.

Distributionally robust polynomial chance-constraints under mixture ambiguity sets

Jean Lasserre, Tillmann Weisser, J. Lasserre, 2018, Mathematical Programming.

The empirical Christoffel function with applications in data analysis

Edouard Pauwels, Jean-Bernard Lasserre, J. Lasserre, 2017, Adv. Comput. Math..

The empirical Christoffel function with applications in Machine Learning

Edouard Pauwels, Jean-Bernard Lasserre, J. Lasserre, 2017 .

Convex Optimization and Parsimony of Lp-balls Representation

Jean B. Lasserre, J. Lasserre, 2016, SIAM J. Optim..

Moments and Legendre-Fourier Series for Measures Supported on Curves

Jean B. Lasserre, J. Lasserre, 2015, 1508.06884.

A Unified Framework for Solving a General Class of Conditional and Robust Set-Membership Estimation Problems

Jean B. Lasserre, Dario Piga, Vito Cerone, 2014, IEEE Transactions on Automatic Control.

Inner Approximations for Polynomial Matrix Inequalities and Robust Stability Regions

Didier Henrion, Jean B. Lasserre, J. Lasserre, 2011, IEEE Transactions on Automatic Control.

A “Joint+Marginal” Approach in Optimization

Jean B. Lasserre, J. Lasserre, 2012 .

Min-max and robust polynomial optimization

Jean B. Lasserre, J. Lasserre, 2011, J. Glob. Optim..

The K-moment problem with densities

Jean B. Lasserre, J. Lasserre, 2008, Math. Program..

Approximate Volume and Integration for

Jean B. Lasserre, C. Savorgnan, D. Henrion, 2009 .

A NEW HIERARCHY OF SDP-RELAXATIONS FOR POLYNOMIAL PROGRAMMING

Jean B. Lasserre, J. Lasserre, 2007 .

Linear Programming Approximations for Markov Control Processes in Metric Spaces

O. Hernández-Lerma, J. Lasserre, O. Hernandez-Lerma, 1997, Proceedings of the 36th IEEE Conference on Decision and Control.

Positivity and Optimization: Beyond Polynomials

Jean B. Lasserre, Mihai Putinar, J. Lasserre, 2012 .

Positivity and Optimization for Semi-Algebraic Functions

Jean B. Lasserre, Mihai Putinar, J. Lasserre, 2009, SIAM J. Optim..

GloptiPoly: global optimization over polynomials with Matlab and SeDuMi

Didier Henrion, Jean B. Lasserre, J. Lasserre, 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

Bounding the support of a measure from its marginal moments

J. Lasserre, 2010, 1011.0138.

Exact Solutions to Super Resolution on Semi-Algebraic Domains in Higher Dimensions

Didier Henrion, Yohann De Castro, F. Gamboa, 2015, IEEE Transactions on Information Theory.

An Approach to Optimal Control Problems Via Exact Penalty Functions

J. Lasserre, 1981 .

Structured Function Systems and Applications

Jean B. Lasserre, Maria Charina, Joachim Stöckler, 2013 .

A moment approach for entropy solutions to nonlinear hyperbolic PDEs

Didier Henrion, Jean Lasserre, Swann Marx, 2018, Mathematical Control & Related Fields.

Modern Optimization Modelling Techniques

Francisco Facchinei, Roberto Cominetti, Jean B. Lasserre, 2012, Advanced courses in mathematics : CRM Barcelona.

Analytic perturbation of Sylvester matrix equations

Konstantin Avrachenkov, Jean B. Lasserre, J. Lasserre, 2002, IEEE Trans. Autom. Control..

Optimization as motion selection principle in robot action

Nicolas Mansard, Jean-Paul Laumond, Jean B. Lasserre, 2015, Commun. ACM.

Aggregate model and decomposition method for mid-term production planning

Jean B. Lasserre, F. Roubellat, J P Martin, 1983 .

Convergent relaxations of polynomial matrix inequalities and static output feedback

Didier Henrion, Jean B. Lasserre, J. Lasserre, 2006, IEEE Transactions on Automatic Control.

An algorithm for semi-infinite polynomial optimization

Jean Lasserre, J. Lasserre, 2011, 1101.4122.

On the existence of a quasistationary measure for a Markov chain

J. Lasserre, C. Pearce, 2001 .

The Moment-SOS Hierarchy

Jean Lasserre, J. Lasserre, 2018, Series on Optimization and Its Applications.

Piecewise-Linear Motion Planning amidst Static, Moving, or Morphing Obstacles pdf

Vikas Sindhwani, Jean Bernard Lasserre, Bachir El Khadir, 2020, 2021 IEEE International Conference on Robotics and Automation (ICRA).

Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets

Didier Henrion, Jean B. Lasserre, Victor Magron, 2015, SIAM J. Optim..

Semialgebraic Representation of Monotone Deep Equilibrium Models and Applications to Certification

Victor Magron, Edouard Pauwels, Jean-Bernard Lasserre, 2021, NeurIPS.

POCP: A package for polynomial optimal control problems

Didier Henrion, Jean B. Lasserre, Carlo Savorgnan, 2008, 2009 European Control Conference (ECC).

A prolongation-projection algorithm for computing the finite real variety of an ideal

Monique Laurent, Jean B. Lasserre, Philipp Rostalski, 2008, Theor. Comput. Sci..

A modified shifting bottleneck procedure for job-shop scheduling

Stéphane Dauzère-Pérès, Jean B. Lasserre, J. Lasserre, 1993 .

On Moment Problems with Holonomic Functions

Florent Bréhard, Mioara Joldes, J. B. Lasserre, 2019, ISSAC.

The truncated K-Moment problem for closure of open sets

J. Lasserre, Greg Blekherman, 2011, 1108.0627.

GloptiPoly 3: moments, optimization and semidefinite programming

Didier Henrion, Jean B. Lasserre, Johan Löfberg, 2007, Optim. Methods Softw..

Polynomials nonnegative on a grid and discrete optimization

Jean B. Lasserre, J. Lasserre, 2001 .

Markov Control Processes

Onésimo Hernández-Lerma, Jean B. Lasserre, O. Hernández-Lerma, 1996 .

The empirical Christoffel function in Statistics and Machine Learning pdf

Jean B. Lasserre, Edouard Pauwels, J. Lasserre, 2017, ArXiv.

Why the logarithmic barrier function in convex and linear programming?

Jean B. Lasserre, J. Lasserre, 2000, Oper. Res. Lett..

Integration on a convex polytope

Jean B. Lasserre, J. Lasserre, 1998 .

Integration and homogeneous functions

Jean B. Lasserre, J. Lasserre, 1999 .

A planning horizon result and a protective forward method for the bounded inventory problem with discounted concave costs

F. Roubellat, C. Bes, J. Lasserre, 1984, The 23rd IEEE Conference on Decision and Control.

Decision Horizon, Overtaking and 1-Optimality Criteria in Optimal Control

J. B. Lasserre, J. Lasserre, 1988 .

Moment and SDP relaxation techniques for smooth approximations of problems involving nonlinear differential equations

Didier Henrion, Martin Mevissen, Jean-Bernard Lasserre, 2010, 1003.4608.

Ergodic Theorems and Ergodic Decomposition for Markov Chains

O. Hernández-Lerma, J. Lasserre, 1998 .

Moment matrices, border bases and real radical computation

Bernard Mourrain, Monique Laurent, Jean B. Lasserre, 2011, J. Symb. Comput..

The Poisson Equation

J. Lasserre, Onésimo Herná-Lerma, 2003 .

Exact formula for sensitivity analysis of Markov chains

J. Lasserre, 1991 .

Simple formula for integration of polynomials on a simplex

J. Lasserre, 2019, BIT Numerical Mathematics.

The Inverse Moment Problem for Convex Polytopes

Nick Gravin, Jean B. Lasserre, Dmitrii V. Pasechnik, 2011, Discret. Comput. Geom..

The Multi-Dimensional Version of ∫ba xp dx

Konstantin Avrachenkov, Jean B. Lasserre, J. Lasserre, 2001, Am. Math. Mon..

A DIRECT APPROACH TO

J. Lasserre, Rolando Cavazos, Blackwell Optimality, 1999 .

TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity

J. Lasserre, Jie Wang, Victor Magron, 2019, SIAM Journal on Optimization.

Infinite-Horizon Discounted-Cost Problems

O. Hernández-Lerma, J. Lasserre, 1996 .

Algebraic–exponential Data Recovery from Moments

Jean B. Lasserre, Mihai Putinar, J. Lasserre, 2015, Discret. Comput. Geom..

Semidefinite programming for min–max problems and games

Rida Laraki, Jean B. Lasserre, J. Lasserre, 2008, Mathematical Programming.

Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension

Victor Magron, Jie Wang, Jean-Bernard Lasserre, 2020, SIAM J. Optim..

Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization

Thorsten Theobald, Jean B. Lasserre, Lina Jansson Andrén, 2011, Math. Oper. Res..

A "Joint+Marginal" Approach to Parametric Polynomial Optimization

Jean B. Lasserre, J. Lasserre, 2009, SIAM J. Optim..

Nonlinear optimal control synthesis via occupation measures

Didier Henrion, Jean B. Lasserre, Carlo Savorgnan, 2008, 2008 47th IEEE Conference on Decision and Control.

Convergent SDP-Relaxations for Polynomial Optimization with Sparsity

Jean B. Lasserre, J. Lasserre, 2006, ICMS.

The fundamental matrix of singularly perturbed Markov chains

Jean B. Lasserre, J. Lasserre, Konstantin E. Avrachenkov, 1999, Advances in Applied Probability.

Stokes, Gibbs, and Volume Computation of Semi-Algebraic Sets

J. Lasserre, D. Henrion, M. Tacchi, 2020, Discrete & Computational Geometry.

Pell’s equation, sum-of-squares and equilibrium measures on a compact set

J. Lasserre, 2022, Comptes Rendus. Mathématique.

Sorting out typicality with the inverse moment matrix SOS polynomial

Jean B. Lasserre, Edouard Pauwels, J. Lasserre, 2016, NIPS.

Pythagoras' Theorem for Areas

Jean B. Lasserre, Jean-Pierre Quadrat, Jean-Baptiste Hiriart-Urruty, 2001, Am. Math. Mon..

A hierarchy of spectral relaxations for polynomial optimization

Victor Magron, Ngoc Hoang Anh Mai, Jean-Bernard Lasserre, 2020, Mathematical Programming Computation.

Positive functionals and Hessenberg matrices

J. Lasserre, M. Putinar, 2018, Proceedings of the American Mathematical Society.

Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems

Vaithilingam Jeyakumar, Guoyin Li, Jean B. Lasserre, 2015, SIAM J. Optim..

A New Look at Nonnegativity on Closed Sets and Polynomial Optimization

Jean B. Lasserre, J. Lasserre, 2010, SIAM J. Optim..

On representations of the feasible set in convex optimization

Jean B. Lasserre, J. Lasserre, 2009, Optim. Lett..

Tractable approximations of sets defined with quantifiers

Jean B. Lasserre, J. Lasserre, 2014, Math. Program..

A Sparse Version of Reznick's Positivstellensatz

J. Lasserre, N. Mai, N. H. A. Mai, 2020, Math. Oper. Res..

On convex optimization without convex representation

Jean B. Lasserre, J. Lasserre, 2010, Optim. Lett..

Convex sets with semidefinite representation

Jean B. Lasserre, J. Lasserre, 2009, Math. Program..

On Polynomial Optimization Over Non-compact Semi-algebraic Sets

Vaithilingam Jeyakumar, Guoyin Li, Jean B. Lasserre, 2013, J. Optim. Theory Appl..

On Polynomial Optimization Over Non-compact Semi-algebraic Sets

J. Lasserre, V. Jeyakumar, G. Li, 2014, Journal of Optimization Theory and Applications.

Polynomial Optimization for Bounding Lipschitz Constants of Deep Networks pdf

Victor Magron, Tong Chen, Edouard Pauwels, 2020, ArXiv.

Semialgebraic Optimization for Lipschitz Constants of ReLU Networks

Victor Magron, Tong Chen, Edouard Pauwels, 2020, NeurIPS.

A Lyapunov Criterion for Invariant Probabilities with Geometric Tail

J. Lasserre, 1998, Probability in the Engineering and Informational Sciences.

Invariant Probabilities with Geometric Tail

J. Lasserre, H. Tijms, 1996, Probability in the Engineering and Informational Sciences.

A modified Christoffel function and its asymptotic properties

J. Lasserre, 2023, Journal of Approximation Theory.

Homogeneous polynomials and spurious local minima on the unit sphere

Jean-Bernard Lasserre, J. Lasserre, 2020, Optimization Letters.

Semidefinite Approximations of the Polynomial Abscissa

Didier Henrion, Jean B. Lasserre, Tien Son Pham, 2015, SIAM J. Control. Optim..

Tractable approximations of sets defined with quantifiers

J. Lasserre, 2014, Mathematical Programming.

Semidefinite approximations of the polynomial abscissa 0

J. Lasserre, D. Henrion, Roxana Hess, 2015 .

Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony?

Bernard Mourrain, Jean-Bernard Lasserre, C'edric Josz, 2017, Advances in Computational Mathematics.

Volume of slices and sections of the simplex in closed form

J. Lasserre, 2015, Optimization Letters.

A Fast and Accurate Method to Compute the Probability of Orbital Collision for Short-term Encounters

J. Lasserre, D. Arzelier, Romain Serra, 2015 .

Volume of slices and sections of the simplex in closed form

Jean B. Lasserre, J. Lasserre, 2014, Optimization Letters.

Level Sets and NonGaussian Integrals of Positively Homogeneous Functions

Jean B. Lasserre, J. Lasserre, 2011, IGTR.

Quasi-Feller Markov chains

J. Lasserre, 2000 .

Bound-Constrained Polynomial Optimization Using Only Elementary Calculations

Etienne de Klerk, Monique Laurent, Zhao Sun, 2015, Math. Oper. Res..

Generating functions and duality for integer programs

Jean B. Lasserre, J. Lasserre, 2004, Discret. Optim..

Integer programming, Barvinok's counting algorithm and Gomory relaxations

Jean B. Lasserre, J. Lasserre, 2004, Oper. Res. Lett..

A Discrete Farkas Lemma

J. Lasserre, 2003, ICCSA.

Duality and a Farkas lemma for integer programs

Jean B. Lasserre, J. Lasserre, 2009 .

Measures and LMIs for Impulsive Nonlinear Optimal Control

Denis Arzelier, Didier Henrion, Jean B. Lasserre, 2014, IEEE Transactions on Automatic Control.

The Christoffel–Darboux Kernel for Data Analysis

J. Lasserre, Edouard Pauwels, M. Putinar, 2022 .

Approximating regions of attraction of a sparse polynomial differential system

J. Lasserre, D. Henrion, M. Tacchi, 2019, IFAC-PapersOnLine.

Leveraging the Christoffel-Darboux Kernel for Online Outlier Detection

J. Lasserre, M. Lann, Youssef Miloudi, 2021 .

Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations

J. Lasserre, D. Henrion, E. Trélat, 2007, SIAM J. Control. Optim..

Linear programming formulation of MDPs in countable state space: The multichain case

Jean B. Lasserre, Arie Hordijk, A. Hordijk, 1994, Math. Methods Oper. Res..

Sparse polynomial interpolation: compressed sensing, super resolution, or Prony?

B. Mourrain, J. Lasserre, C. Josz, 2017, 1708.06187.

A Unified Framework for Solving a General Class of Conditional and Robust Set-Membership Estimation Problems

J. Lasserre, V. Cerone, D. Regruto, 2014, IEEE Transactions on Automatic Control.

Optimization of Polynomials with Sparsity Encoded in a Few Linear Forms

J. Lasserre, 2022, IFAC-PapersOnLine.

A sublevel moment-SOS hierarchy for polynomial optimization

Victor Magron, Edouard Pauwels, Jean-Bernard Lasserre, 2021, Computational Optimization and Applications.

Minimizing Rational Functions: A Hierarchy of Approximations via Pushforward Measures

Victor Magron, Swann Marx, Olivier Zahm, 2020, SIAM J. Optim..

CS-TSSOS: Correlative and Term Sparsity for Large-Scale Polynomial Optimization

J. Lasserre, N. Mai, Jie Wang, 2020, ACM Trans. Math. Softw..

Exploiting Sparsity for Semi-Algebraic Set Volume Computation

D. Henrion, M. Tacchi, T. Weisser, 2019, Foundations of Computational Mathematics.

Positivity certificates and polynomial optimization on non-compact semialgebraic sets

J. Lasserre, N. Mai, Victor Magron, 2019, Mathematical Programming.

New approximations for the cone of copositive matrices and its dual

Jean B. Lasserre, J. Lasserre, 2010, Mathematical Programming.

Nonnegative forms with sublevel sets of minimal volume

J. Lasserre, Khazhgali Kozhasov, 2019, Mathematical Programming.

Polynomial Programming: LP-Relaxations Also Converge

Jean B. Lasserre, J. Lasserre, 2005, SIAM J. Optim..

Inverse optimal control with polynomial optimization

J. Lasserre, D. Henrion, Edouard Pauwels, 2014, 53rd IEEE Conference on Decision and Control.