Jean B. Lasserre

143 papers A* 3B 3Misc 1Journal 114Unranked 21
YearRankTypeTitle / Venue / Authors
2026 J jnl
A Christoffel-like function for high-dimensional support inference in graphical models.
J. Approx. Theory
Jean B. Lasserre, Lucas Slot
2025 J jnl
A Laplace Duality for Integration.
IEEE Control. Syst. Lett.
Jean B. Lasserre
2025 J jnl
Optimization-aided construction of multivariate Chebyshev polynomials.
J. Approx. Theory
Mareike Dressler, Simon Foucart, Mioara Joldes, Etienne de Klerk, Jean B. Lasserre, Yuan Xu
2025 A* conf
Verifying Properties of Binary Neural Networks Using Sparse Polynomial Optimization.
ICLR
Jianting Yang, Srecko Ðurasinovic, Jean B. Lasserre, Victor Magron, Jun Zhao
2024 J jnl
The Moment-SOS hierarchy: Applications and related topics.
Acta Numer.
Jean B. Lasserre
2023 J jnl
A Sparse Version of Reznick's Positivstellensatz.
Math. Oper. Res.
Ngoc Hoang Anh Mai, Victor Magron, Jean B. Lasserre
2023 J jnl
A modified Christoffel function and its asymptotic properties.
J. Approx. Theory
Jean B. Lasserre
2023 J jnl
Volumes of Sublevel Sets of Nonnegative Forms and Complete Monotonicity.
SIAM J. Appl. Algebra Geom.
Khazhgali Kozhasov, Jean B. Lasserre
2022 J jnl
CS-TSSOS: Correlative and Term Sparsity for Large-Scale Polynomial Optimization.
ACM Trans. Math. Softw.
Jie Wang, Victor Magron, Jean B. Lasserre, Ngoc Hoang Anh Mai
2022 J jnl
Exploiting Constant Trace Property in Large-scale Polynomial Optimization.
ACM Trans. Math. Softw.
Ngoc Hoang Anh Mai, Jean B. Lasserre, Victor Magron, Jie Wang
2022 J jnl
Homogeneous polynomials and spurious local minima on the unit sphere.
Optim. Lett.
Jean B. Lasserre
2022 J jnl
Optimization on the Euclidean Unit Sphere.
SIAM J. Optim.
Jean B. Lasserre
2021 J jnl
Connecting optimization with spectral analysis of tri-diagonal matrices.
Math. Program.
Jean B. Lasserre
2021 J jnl
Distributionally robust polynomial chance-constraints under mixture ambiguity sets.
Math. Program.
Jean B. Lasserre, Tillmann Weißer
2021 — conf
Polynomial superlevel set approximation of swept-volume for computing collision probability in space encounters.
CDC
Denis Arzelier, Florent Bréhard, Mioara Joldes, Jean B. Lasserre, S. Laurens, Aude Rondepierre
2021 A* conf
Semialgebraic Representation of Monotone Deep Equilibrium Models and Applications to Certification.
NeurIPS
Tong Chen, Jean B. Lasserre, Victor Magron, Edouard Pauwels
2021 J jnl
The moment-SOS hierarchy and the Christoffel-Darboux kernel.
Optim. Lett.
Jean B. Lasserre
2020 J jnl
CS-TSSOS: Correlative and term sparsity for large-scale polynomial optimization.
CoRR
Jie Wang, Victor Magron, Jean B. Lasserre, Ngoc Hoang Anh Mai
2020 J jnl
Computing the Hausdorff Boundary Measure of Semialgebraic Sets.
SIAM J. Appl. Algebra Geom.
Jean B. Lasserre, Victor Magron
2020 A* conf
Semialgebraic Optimization for Lipschitz Constants of ReLU Networks.
NeurIPS
Tong Chen, Jean B. Lasserre, Victor Magron, Edouard Pauwels
2019 J jnl
Approximating regions of attraction of a sparse polynomial differential system.
CoRR
Matteo Tacchi, Carmen Cardozo, Didier Henrion, Jean B. Lasserre
2019 J jnl
Connecting optimization with spectral analysis of tri-diagonal matrices.
CoRR
Jean B. Lasserre
2019 J jnl
Semidefinite Relaxations for Lebesgue and Gaussian Measures of Unions of Basic Semialgebraic Sets.
Math. Oper. Res.
Jean B. Lasserre, Youssouf Emin
2019 J jnl
Simple formula for integration of polynomials on a simplex.
CoRR
Jean B. Lasserre
2019 J jnl
The empirical Christoffel function with applications in data analysis.
Adv. Comput. Math.
Jean B. Lasserre, Edouard Pauwels
2019 J jnl
Volume of Sublevel Sets of Homogeneous Polynomials.
SIAM J. Appl. Algebra Geom.
Jean B. Lasserre
2019 — conf
Volume of sub-level sets of polynomials.
ECC
Jean B. Lasserre
2018 J jnl
Determining projection constants of univariate polynomial spaces.
J. Approx. Theory
Simon Foucart, Jean B. Lasserre
2018 J jnl
Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity.
Math. Program. Comput.
Tillmann Weißer, Jean B. Lasserre, Kim-Chuan Toh
2017 J jnl
A bounded degree SOS hierarchy for polynomial optimization.
EURO J. Comput. Optim.
Jean B. Lasserre, Kim-Chuan Toh, Shouguang Yang
2017 J jnl
Bound-Constrained Polynomial Optimization Using Only Elementary Calculations.
Math. Oper. Res.
Etienne de Klerk, Jean B. Lasserre, Monique Laurent, Zhao Sun
2017 J jnl
Computing Gaussian & exponential measures of semi-algebraic sets.
Adv. Appl. Math.
Jean B. Lasserre
2017 J jnl
Exact Solutions to Super Resolution on Semi-Algebraic Domains in Higher Dimensions.
IEEE Trans. Inf. Theory
Yohann de Castro, Fabrice Gamboa, Didier Henrion, Jean B. Lasserre
2017 J jnl
Representation of Chance-Constraints With Strong Asymptotic Guarantees.
IEEE Control. Syst. Lett.
Jean B. Lasserre
2016 J jnl
A MAX-CUT formulation of 0/1 programs.
Oper. Res. Lett.
Jean B. Lasserre
2016 J jnl
Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems.
SIAM J. Optim.
Vaithilingam Jeyakumar, Jean B. Lasserre, Guoyin Li, T. S. Pham
2016 J jnl
Convex Optimization and Parsimony of L
SIAM J. Optim.
Jean B. Lasserre
2016 J jnl
Lebesgue decomposition in action via semidefinite relaxations.
Adv. Comput. Math.
Jean B. Lasserre
2016 — conf
Sorting out typicality with the inverse moment matrix SOS polynomial.
NIPS
Edouard Pauwels, Jean B. Lasserre
2015 J jnl
A generalization of Löwner-John's ellipsoid theorem.
Math. Program.
Jean B. Lasserre
2015 J jnl
Exact solutions to Super Resolution on semi-algebraic domains in higher dimensions.
CoRR
Yohann de Castro, Fabrice Gamboa, Didier Henrion, Jean B. Lasserre
2015 J jnl
Level Sets and NonGaussian Integrals of Positively Homogeneous Functions.
IGTR
Jean B. Lasserre
2015 J jnl
The 2013 Newton Institute Programme on polynomial optimization.
Math. Program.
Adam N. Letchford, Jean B. Lasserre, Pablo A. Parrilo, David Steurer
2015 J jnl
Tractable approximations of sets defined with quantifiers.
Math. Program.
Jean B. Lasserre
2015 J jnl
Volume of slices and sections of the simplex in closed form.
Optim. Lett.
Jean B. Lasserre
2014 J jnl
Erratum to: On convex optimization without convex representation.
Optim. Lett.
Jean B. Lasserre
2014 J jnl
Lower bounds on the global minimum of a polynomial.
Comput. Optim. Appl.
Mehdi Ghasemi, Jean B. Lasserre, M. Marshall
2014 J jnl
New approximations for the cone of copositive matrices and its dual.
Math. Program.
Jean B. Lasserre
2014 J jnl
On Polynomial Optimization Over Non-compact Semi-algebraic Sets.
J. Optim. Theory Appl.
Vaithilingam Jeyakumar, Jean B. Lasserre, Guoyin Li
2013 J jnl
A Lagrangian Relaxation View of Linear and Semidefinite Hierarchies.
SIAM J. Optim.
Jean B. Lasserre
2013 — conf
A Lagrangian relaxation view of linear and semidefinite hierarchies.
CDC
Jean B. Lasserre
2013 — conf
A generalization of the Löwner-John's ellipsoid theorem.
CDC
Jean B. Lasserre
2013 J jnl
Convex underestimators of polynomials.
J. Glob. Optim.
Jean B. Lasserre, Tung Phan Thanh
2013 J jnl
Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization.
Math. Oper. Res.
Cordian Riener, Thorsten Theobald, Lina Jansson Andrén, Jean B. Lasserre
2013 J jnl
Inverse Polynomial Optimization.
Math. Oper. Res.
Jean B. Lasserre
2013 J jnl
Recovering an Homogeneous Polynomial from Moments of Its Level Set.
Discret. Comput. Geom.
Jean B. Lasserre
2012 J jnl
A "joint + marginal" heuristic for 0/1 programs.
J. Glob. Optim.
Jean B. Lasserre, Tung Phan Thanh
2012 J jnl
Inner Approximations for Polynomial Matrix Inequalities and Robust Stability Regions.
IEEE Trans. Autom. Control.
Didier Henrion, Jean B. Lasserre
2012 — book
Modern Optimization Modelling Techniques.
Roberto Cominetti, Francisco Facchinei, Jean B. Lasserre
2012 J jnl
Semidefinite programming for min-max problems and games.
Math. Program.
Rida Laraki, Jean B. Lasserre
2012 J jnl
The Inverse Moment Problem for Convex Polytopes.
Discret. Comput. Geom.
Nick Gravin, Jean B. Lasserre, Dmitrii V. Pasechnik, Sinai Robins
2012 J jnl
The existence of Gaussian cubature formulas.
J. Approx. Theory
Jean B. Lasserre
2011 J jnl
A New Look at Nonnegativity on Closed Sets and Polynomial Optimization.
SIAM J. Optim.
Jean B. Lasserre
2011 — conf
Convex underestimators of polynomials.
CDC/ECC
Jean B. Lasserre, Tung Phan Thanh
2011 J jnl
Exploiting symmetries in SDP-relaxations for polynomial optimization
CoRR
Cordian Riener, Thorsten Theobald, Lina Jansson Andrén, Jean B. Lasserre
2011 J jnl
Inner approximations for polynomial matrix inequalities and robust stability regions
CoRR
Didier Henrion, Jean B. Lasserre
2011 — conf
Inverse polynomial optimization.
CDC/ECC
Jean B. Lasserre
2011 J jnl
Min-max and robust polynomial optimization.
J. Glob. Optim.
Jean B. Lasserre
2011 J jnl
Minimizing the sum of many rational functions
CoRR
Florian Bugarin, Didier Henrion, Jean B. Lasserre
2011 J jnl
On convex optimization without convex representation.
Optim. Lett.
Jean B. Lasserre
2011 J jnl
The inverse moment problem for convex polytopes
CoRR
Nick Gravin, Jean B. Lasserre, Dmitrii V. Pasechnik, Sinai Robins
2010 J jnl
A "Joint+Marginal" Approach to Parametric Polynomial Optimization.
SIAM J. Optim.
Jean B. Lasserre
2010 — conf
A "joint+marginal" algorithm for polynomial optimization.
CDC
Jean B. Lasserre, Tung Phan Thanh
2010 J jnl
Certificates of convexity for basic semi-algebraic sets.
Appl. Math. Lett.
Jean B. Lasserre
2010 J jnl
On representations of the feasible set in convex optimization.
Optim. Lett.
Jean B. Lasserre
2010 J jnl
Positivity and Optimization for Semi-Algebraic Functions.
SIAM J. Optim.
Jean B. Lasserre, Mihai Putinar
2009 J jnl
A prolongation-projection algorithm for computing the finite real variety of an ideal.
Theor. Comput. Sci.
Jean B. Lasserre, Monique Laurent, Philipp Rostalski
2009 J jnl
Approximate Volume and Integration for Basic Semialgebraic Sets.
SIAM Rev.
Didier Henrion, Jean B. Lasserre, Carlo Savorgnan
2009 J jnl
Certificates and relaxations for integer programming and the semi-group membership problem
CoRR
Jean B. Lasserre, Eduardo S. Zeron
2009 J jnl
Convex sets with semidefinite representation.
Math. Program.
Jean B. Lasserre
2009 J jnl
Convexity in SemiAlgebraic Geometry and Polynomial Optimization.
SIAM J. Optim.
Jean B. Lasserre
2009 — conf
Discrete-time stochastic optimal control via occupation measures and moment relaxations.
CDC
Carlo Savorgnan, Jean B. Lasserre, Moritz Diehl
2009 J jnl
Moments and sums of squares for polynomial optimization and related problems.
J. Glob. Optim.
Jean B. Lasserre
2009 — conf
POCP: A package for polynomial optimal control problems.
ECC
Didier Henrion, Jean B. Lasserre, Carlo Savorgnan
2009 J jnl
The K-moment problem with densities.
Math. Program.
Jean B. Lasserre
2008 J jnl
A semidefinite programming approach to the generalized problem of moments.
Math. Program.
Jean B. Lasserre
2008 J jnl
Approximating integrals of multivariate exponentials: A moment approach.
Oper. Res. Lett.
Dimitris Bertsimas, Xuan Vinh Doan, Jean B. Lasserre
2008 Misc conf
Computing the real variety of an ideal: a real algebraic and symbolic-numeric algorithm.
SAC
Jean B. Lasserre, Monique Laurent, Philipp Rostalski
2008 J jnl
Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations.
SIAM J. Control. Optim.
Jean B. Lasserre, Didier Henrion, Christophe Prieur, Emmanuel Trélat
2008 — conf
Nonlinear optimal control synthesis via occupation measures.
CDC
Didier Henrion, Jean B. Lasserre, Carlo Savorgnan
2008 J jnl
Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals.
Found. Comput. Math.
Jean B. Lasserre, Monique Laurent, Philipp Rostalski
2008 J jnl
Semidefinite programming for N-Player Games
CoRR
Rida Laraki, Jean B. Lasserre
2007 J jnl
A Sum of Squares Approximation of Nonnegative Polynomials.
SIAM Rev.
Jean B. Lasserre
2007 — conf
Semidefinite programming for gradient and Hessian computation in maximum entropy estimation.
CDC
Jean B. Lasserre
2007 B conf
Simple Explicit Formula for Counting Lattice Points of Polyhedra.
IPCO
Jean B. Lasserre, Eduardo S. Zeron
2006 J jnl
A Sum of Squares Approximation of Nonnegative Polynomials.
SIAM J. Optim.
Jean B. Lasserre
2006 — conf
Convergent SDP-Relaxations for Polynomial Optimization with Sparsity.
ICMS
Jean B. Lasserre
2006 J jnl
Convergent SDP-Relaxations in Polynomial Optimization with Sparsity.
SIAM J. Optim.
Jean B. Lasserre
2006 J jnl
Convergent relaxations of polynomial matrix inequalities and static output feedback.
IEEE Trans. Autom. Control.
Didier Henrion, Jean B. Lasserre
2006 J jnl
LMIs for constrained polynomial interpolation with application in trajectory planning.
Syst. Control. Lett.
Didier Henrion, Jean B. Lasserre
2006 J jnl
Robust global optimization with polynomials.
Math. Program.
Jean B. Lasserre
2005 J jnl
An Alternative Algorithm for Counting Lattice Points in a Convex Polytope.
Math. Oper. Res.
Jean B. Lasserre, Eduardo S. Zeron
2005 J jnl
Erratum to "Generating functions and duality for integer programs": [Discrete Optimization 1 (2) (2004) 167-187].
Discret. Optim.
Jean B. Lasserre
2005 J jnl
Hierarchical scheduling for decision support.
J. Intell. Manuf.
Gérard Fontan, Colette Mercé, Jean-Claude Hennet, Jean B. Lasserre
2005 — conf
Nonlinear optimal control: approximations via moments and LMI-relaxations.
CDC/ECC
Jean B. Lasserre, Christophe Prieur, Didier Henrion
2005 J jnl
Polynomial Programming: LP-Relaxations Also Converge.
SIAM J. Optim.
Jean B. Lasserre
2005 — conf
SOS approximation of polynomials nonnegative on an algebraic set.
CDC/ECC
Jean B. Lasserre
2005 J jnl
Sum of Squares Approximation of Polynomials, Nonnegative on a Real Algebraic Set.
SIAM J. Optim.
Jean B. Lasserre
2004 J jnl
A discrete Farkas lemma.
Discret. Optim.
Jean B. Lasserre
2004 J jnl
Characterizing polynomials with roots in a semialgebraic set.
IEEE Trans. Autom. Control.
Jean B. Lasserre
2004 J jnl
Generating functions and duality for integer programs.
Discret. Optim.
Jean B. Lasserre
2004 J jnl
Integer programming, Barvinok's counting algorithm and Gomory relaxations.
Oper. Res. Lett.
Jean B. Lasserre
2004 J jnl
The Integer Hull of a Convex Rational Polytope.
Discret. Comput. Geom.
Jean B. Lasserre
2003 — conf
A Discrete Farkas Lemma.
ICCSA (1)
Jean B. Lasserre
2003 — conf
Characterizing polynomials with roots in a semi-algebraic set.
CDC
Jean B. Lasserre
2003 J jnl
GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi.
ACM Trans. Math. Softw.
Didier Henrion, Jean B. Lasserre
2003 J jnl
On Counting Integral Points in a Convex Rational Polytope.
Math. Oper. Res.
Jean B. Lasserre, Eduardo S. Zeron
2003 — conf
The Integer Hull of a Convex Rational Polytope.
ICCSA (3)
Jean B. Lasserre
2002 J jnl
An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs.
SIAM J. Optim.
Jean B. Lasserre
2002 J jnl
Analytic perturbation of Sylvester matrix equations.
IEEE Trans. Autom. Control.
Konstantin Avrachenkov, Jean B. Lasserre
2002 J jnl
Semidefinite Programming vs. LP Relaxations for Polynomial Programming.
Math. Oper. Res.
Jean B. Lasserre
2002 — conf
Solving Global Optimization Problems over Polynomials with GloptiPoly 2.1.
COCOS
Didier Henrion, Jean B. Lasserre
2002 J jnl
Solving the knapsack problem via Z-transform.
Oper. Res. Lett.
Jean B. Lasserre, Eduardo S. Zeron
2001 J jnl
A Laplace transform algorithm for the volume of a convex polytope.
J. ACM
Jean B. Lasserre, Eduardo S. Zeron
2001 J jnl
A Quick Proof for the Volume of n-Balls.
Am. Math. Mon.
Jean B. Lasserre
2001 B conf
An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs.
IPCO
Jean B. Lasserre
2001 J jnl
Global Optimization with Polynomials and the Problem of Moments.
SIAM J. Optim.
Jean B. Lasserre
2001 J jnl
Pythagoras' Theorem for Areas.
Am. Math. Mon.
Jean-Pierre Quadrat, Jean B. Lasserre, Jean-Baptiste Hiriart-Urruty
2001 J jnl
The Multi-Dimensional Version of ∫
Am. Math. Mon.
Jean B. Lasserre, Konstantin Avrachenkov
2000 — conf
Analytic perturbation of Sylvester and Lyapunov matrix equations.
CDC
Konstantin E. Avrachenkov, Jean B. Lasserre
2000 — conf
Convergent LMI relaxations for nonconvex quadratic programs.
CDC
Jean B. Lasserre
2000 J jnl
Why the logarithmic barrier function in convex and linear programming?
Oper. Res. Lett.
Jean B. Lasserre
2000 J jnl
Zero-Sum Stochastic Games in Borel Spaces: Average Payoff Criteria.
SIAM J. Control. Optim.
Onésimo Hernández-Lerma, Jean B. Lasserre
1998 J jnl
Approximation Schemes for Infinite Linear Programs.
SIAM J. Optim.
Onésimo Hernández-Lerma, Jean B. Lasserre
1998 J jnl
Multi-resource shop scheduling with resource flexibility.
Eur. J. Oper. Res.
Stéphane Dauzère-Pérès, W. Roux, Jean B. Lasserre
1997 J jnl
Tight bounds for the trace of a matrix product.
IEEE Trans. Autom. Control.
Jean B. Lasserre
1995 J jnl
A new Farkas lemma for positive semidefinite matrices.
IEEE Trans. Autom. Control.
Jean B. Lasserre
1995 J jnl
A trace inequality for matrix product.
IEEE Trans. Autom. Control.
Jean B. Lasserre
1994 J jnl
Linear programming formulation of MDPs in countable state space: The multichain case.
Math. Methods Oper. Res.
Arie Hordijk, Jean B. Lasserre
1993 J jnl
Reachable, controllable sets and stabilizing control of constrained linear systems.
Autom.
Jean B. Lasserre
1992 B conf
Generic Scheduling Polyhedra and a New Mixed-Integer Formulation for Single-Machine Scheduling.
IPCO
Jean B. Lasserre, Maurice Queyranne
1985 J jnl
Technical Note - The Stochastic Discrete Dynamic Lot Size Problem: An Open-Loop Solution.
Oper. Res.
Jean B. Lasserre, C. Bes, François Roubellat
1981 J jnl
An economic interpretation of exact penalty functions using sensitivity analysis.
Oper. Res. Lett.
Jean B. Lasserre