Jean B. Lasserre

ORCID

Publication Activity (10 Years)

Years Active: 1981-2023
Publications (10 Years): 40

Top Venues

Publications

Khazhgali Kozhasov, Jean B. Lasserre
Volumes of Sublevel Sets of Nonnegative Forms and Complete Monotonicity. SIAM J. Appl. Algebra Geom. 7 (4) (2023)
Ngoc Hoang Anh Mai, Victor Magron, Jean B. Lasserre
A Sparse Version of Reznick's Positivstellensatz. Math. Oper. Res. 48 (2) (2023)
Jean B. Lasserre
A modified Christoffel function and its asymptotic properties. J. Approx. Theory 295 (2023)
Ngoc Hoang Anh Mai, Jean B. Lasserre, Victor Magron, Jie Wang
Exploiting Constant Trace Property in Large-scale Polynomial Optimization. ACM Trans. Math. Softw. 48 (4) (2022)
Jie Wang, Victor Magron, Jean B. Lasserre, Ngoc Hoang Anh Mai
CS-TSSOS: Correlative and Term Sparsity for Large-Scale Polynomial Optimization. ACM Trans. Math. Softw. 48 (4) (2022)
Jean B. Lasserre
Optimization on the Euclidean Unit Sphere. SIAM J. Optim. 32 (2) (2022)
Jean B. Lasserre
Homogeneous polynomials and spurious local minima on the unit sphere. Optim. Lett. 16 (4) (2022)
Jean B. Lasserre
The moment-SOS hierarchy and the Christoffel-Darboux kernel. Optim. Lett. 15 (6) (2021)
Tong Chen, Jean B. Lasserre, Victor Magron, Edouard Pauwels
Semialgebraic Representation of Monotone Deep Equilibrium Models and Applications to Certification. NeurIPS (2021)
Jean B. Lasserre, Tillmann Weißer
Distributionally robust polynomial chance-constraints under mixture ambiguity sets. Math. Program. 185 (1-2) (2021)
Jean B. Lasserre
Connecting optimization with spectral analysis of tri-diagonal matrices. Math. Program. 190 (1) (2021)
Denis Arzelier, Florent Bréhard, Mioara Joldes, Jean B. Lasserre, S. Laurens, Aude Rondepierre
Polynomial superlevel set approximation of swept-volume for computing collision probability in space encounters. CDC (2021)
Jean B. Lasserre, Victor Magron
Computing the Hausdorff Boundary Measure of Semialgebraic Sets. SIAM J. Appl. Algebra Geom. 4 (3) (2020)
Jie Wang, Victor Magron, Jean B. Lasserre, Ngoc Hoang Anh Mai
CS-TSSOS: Correlative and term sparsity for large-scale polynomial optimization. CoRR (2020)
Tong Chen, Jean B. Lasserre, Victor Magron, Edouard Pauwels
Semialgebraic Optimization for Lipschitz Constants of ReLU Networks. NeurIPS (2020)
Jean B. Lasserre
Volume of sub-level sets of polynomials. ECC (2019)
Jean B. Lasserre
Connecting optimization with spectral analysis of tri-diagonal matrices. CoRR (2019)
Jean B. Lasserre, Youssouf Emin
Semidefinite Relaxations for Lebesgue and Gaussian Measures of Unions of Basic Semialgebraic Sets. Math. Oper. Res. 44 (4) (2019)
Matteo Tacchi, Carmen Cardozo, Didier Henrion, Jean B. Lasserre
Approximating regions of attraction of a sparse polynomial differential system. CoRR (2019)
Jean B. Lasserre
Volume of Sublevel Sets of Homogeneous Polynomials. SIAM J. Appl. Algebra Geom. 3 (2) (2019)
Jean B. Lasserre, Edouard Pauwels
The empirical Christoffel function with applications in data analysis. Adv. Comput. Math. 45 (3) (2019)
Jean B. Lasserre
Simple formula for integration of polynomials on a simplex. CoRR (2019)
Simon Foucart, Jean B. Lasserre
Determining projection constants of univariate polynomial spaces. J. Approx. Theory 235 (2018)
Tillmann Weißer, Jean B. Lasserre, Kim-Chuan Toh
Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity. Math. Program. Comput. 10 (1) (2018)
Jean B. Lasserre
Representation of Chance-Constraints With Strong Asymptotic Guarantees. IEEE Control. Syst. Lett. 1 (1) (2017)
Jean B. Lasserre, Kim-Chuan Toh, Shouguang Yang
A bounded degree SOS hierarchy for polynomial optimization. EURO J. Comput. Optim. 5 (1-2) (2017)
Yohann de Castro, Fabrice Gamboa, Didier Henrion, Jean B. Lasserre
Exact Solutions to Super Resolution on Semi-Algebraic Domains in Higher Dimensions. IEEE Trans. Inf. Theory 63 (1) (2017)
Etienne de Klerk, Jean B. Lasserre, Monique Laurent, Zhao Sun
Bound-Constrained Polynomial Optimization Using Only Elementary Calculations. Math. Oper. Res. 42 (3) (2017)
Jean B. Lasserre
Computing Gaussian & exponential measures of semi-algebraic sets. Adv. Appl. Math. 91 (2017)
Jean B. Lasserre
A MAX-CUT formulation of 0/1 programs. Oper. Res. Lett. 44 (2) (2016)
Jean B. Lasserre
-balls Representation. SIAM J. Optim. 26 (1) (2016)
Jean B. Lasserre
Lebesgue decomposition in action via semidefinite relaxations. Adv. Comput. Math. 42 (5) (2016)
Edouard Pauwels, Jean B. Lasserre
Sorting out typicality with the inverse moment matrix SOS polynomial. NIPS (2016)
Vaithilingam Jeyakumar, Jean B. Lasserre, Guoyin Li, T. S. Pham
Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems. SIAM J. Optim. 26 (1) (2016)
Jean B. Lasserre
Tractable approximations of sets defined with quantifiers. Math. Program. 151 (2) (2015)
Jean B. Lasserre
A generalization of Löwner-John's ellipsoid theorem. Math. Program. 152 (1-2) (2015)
Adam N. Letchford, Jean B. Lasserre, Pablo A. Parrilo, David Steurer
The 2013 Newton Institute Programme on polynomial optimization. Math. Program. 151 (2) (2015)
Yohann de Castro, Fabrice Gamboa, Didier Henrion, Jean B. Lasserre
Exact solutions to Super Resolution on semi-algebraic domains in higher dimensions. CoRR (2015)
Jean B. Lasserre
Volume of slices and sections of the simplex in closed form. Optim. Lett. 9 (7) (2015)
Jean B. Lasserre
Level Sets and NonGaussian Integrals of Positively Homogeneous Functions. IGTR 17 (1) (2015)
Mehdi Ghasemi, Jean B. Lasserre, M. Marshall
Lower bounds on the global minimum of a polynomial. Comput. Optim. Appl. 57 (2) (2014)
Jean B. Lasserre
Erratum to: On convex optimization without convex representation. Optim. Lett. 8 (5) (2014)
Jean B. Lasserre
New approximations for the cone of copositive matrices and its dual. Math. Program. 144 (1-2) (2014)
Vaithilingam Jeyakumar, Jean B. Lasserre, Guoyin Li
On Polynomial Optimization Over Non-compact Semi-algebraic Sets. J. Optim. Theory Appl. 163 (3) (2014)
Jean B. Lasserre
A Lagrangian Relaxation View of Linear and Semidefinite Hierarchies. SIAM J. Optim. 23 (3) (2013)
Jean B. Lasserre
Inverse Polynomial Optimization. Math. Oper. Res. 38 (3) (2013)
Jean B. Lasserre
A generalization of the Löwner-John's ellipsoid theorem. CDC (2013)
Jean B. Lasserre
Recovering an Homogeneous Polynomial from Moments of Its Level Set. Discret. Comput. Geom. 50 (3) (2013)
Cordian Riener, Thorsten Theobald, Lina Jansson Andrén, Jean B. Lasserre
Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization. Math. Oper. Res. 38 (1) (2013)
Jean B. Lasserre
A Lagrangian relaxation view of linear and semidefinite hierarchies. CDC (2013)
Jean B. Lasserre, Tung Phan Thanh
Convex underestimators of polynomials. J. Glob. Optim. 56 (1) (2013)
Rida Laraki, Jean B. Lasserre
Semidefinite programming for min-max problems and games. Math. Program. 131 (1-2) (2012)
Didier Henrion, Jean B. Lasserre
Inner Approximations for Polynomial Matrix Inequalities and Robust Stability Regions. IEEE Trans. Autom. Control. 57 (6) (2012)
Jean B. Lasserre, Tung Phan Thanh
A "joint + marginal" heuristic for 0/1 programs. J. Glob. Optim. 54 (4) (2012)
Jean B. Lasserre
The existence of Gaussian cubature formulas. J. Approx. Theory 164 (5) (2012)
Nick Gravin, Jean B. Lasserre, Dmitrii V. Pasechnik, Sinai Robins
The Inverse Moment Problem for Convex Polytopes. Discret. Comput. Geom. 48 (3) (2012)
Didier Henrion, Jean B. Lasserre
Inner approximations for polynomial matrix inequalities and robust stability regions CoRR (2011)
Jean B. Lasserre
On convex optimization without convex representation. Optim. Lett. 5 (4) (2011)
Jean B. Lasserre, Tung Phan Thanh
Convex underestimators of polynomials. CDC/ECC (2011)
Jean B. Lasserre
Inverse polynomial optimization. CDC/ECC (2011)
Nick Gravin, Jean B. Lasserre, Dmitrii V. Pasechnik, Sinai Robins
The inverse moment problem for convex polytopes CoRR (2011)
Jean B. Lasserre
A New Look at Nonnegativity on Closed Sets and Polynomial Optimization. SIAM J. Optim. 21 (3) (2011)
Cordian Riener, Thorsten Theobald, Lina Jansson Andrén, Jean B. Lasserre
Exploiting symmetries in SDP-relaxations for polynomial optimization CoRR (2011)
Jean B. Lasserre
Min-max and robust polynomial optimization. J. Glob. Optim. 51 (1) (2011)
Florian Bugarin, Didier Henrion, Jean B. Lasserre
Minimizing the sum of many rational functions CoRR (2011)
Jean B. Lasserre
On representations of the feasible set in convex optimization. Optim. Lett. 4 (1) (2010)
Jean B. Lasserre, Tung Phan Thanh
A "joint+marginal" algorithm for polynomial optimization. CDC (2010)
Jean B. Lasserre
Certificates of convexity for basic semi-algebraic sets. Appl. Math. Lett. 23 (8) (2010)
Jean B. Lasserre, Mihai Putinar
Positivity and Optimization for Semi-Algebraic Functions. SIAM J. Optim. 20 (6) (2010)
Jean B. Lasserre
A "Joint+Marginal" Approach to Parametric Polynomial Optimization. SIAM J. Optim. 20 (4) (2010)
Jean B. Lasserre
The K-moment problem with densities. Math. Program. 116 (1-2) (2009)
Carlo Savorgnan, Jean B. Lasserre, Moritz Diehl
Discrete-time stochastic optimal control via occupation measures and moment relaxations. CDC (2009)
Jean B. Lasserre, Eduardo S. Zeron
Certificates and relaxations for integer programming and the semi-group membership problem CoRR (2009)
Didier Henrion, Jean B. Lasserre, Carlo Savorgnan
Approximate Volume and Integration for Basic Semialgebraic Sets. SIAM Rev. 51 (4) (2009)
Didier Henrion, Jean B. Lasserre, Carlo Savorgnan
POCP: A package for polynomial optimal control problems. ECC (2009)
Jean B. Lasserre
Moments and sums of squares for polynomial optimization and related problems. J. Glob. Optim. 45 (1) (2009)
Jean B. Lasserre
Convex sets with semidefinite representation. Math. Program. 120 (2) (2009)
Jean B. Lasserre, Monique Laurent, Philipp Rostalski
A prolongation-projection algorithm for computing the finite real variety of an ideal. Theor. Comput. Sci. 410 (27-29) (2009)
Jean B. Lasserre
Convexity in SemiAlgebraic Geometry and Polynomial Optimization. SIAM J. Optim. 19 (4) (2009)
Rida Laraki, Jean B. Lasserre
Semidefinite programming for N-Player Games CoRR (2008)
Jean B. Lasserre, Didier Henrion, Christophe Prieur, Emmanuel Trélat
Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations. SIAM J. Control. Optim. 47 (4) (2008)
Jean B. Lasserre, Monique Laurent, Philipp Rostalski
Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals. Found. Comput. Math. 8 (5) (2008)
Jean B. Lasserre
A semidefinite programming approach to the generalized problem of moments. Math. Program. 112 (1) (2008)
Jean B. Lasserre, Monique Laurent, Philipp Rostalski
Computing the real variety of an ideal: a real algebraic and symbolic-numeric algorithm. SAC (2008)
Didier Henrion, Jean B. Lasserre, Carlo Savorgnan
Nonlinear optimal control synthesis via occupation measures. CDC (2008)
Dimitris Bertsimas, Xuan Vinh Doan, Jean B. Lasserre
Approximating integrals of multivariate exponentials: A moment approach. Oper. Res. Lett. 36 (2) (2008)
Jean B. Lasserre
A Sum of Squares Approximation of Nonnegative Polynomials. SIAM Rev. 49 (4) (2007)
Jean B. Lasserre
Semidefinite programming for gradient and Hessian computation in maximum entropy estimation. CDC (2007)
Jean B. Lasserre, Eduardo S. Zeron
Simple Explicit Formula for Counting Lattice Points of Polyhedra. IPCO (2007)
Jean B. Lasserre
Convergent SDP-Relaxations for Polynomial Optimization with Sparsity. ICMS (2006)
Jean B. Lasserre
Robust global optimization with polynomials. Math. Program. 107 (1-2) (2006)
Jean B. Lasserre
A Sum of Squares Approximation of Nonnegative Polynomials. SIAM J. Optim. 16 (3) (2006)
Jean B. Lasserre
Convergent SDP-Relaxations in Polynomial Optimization with Sparsity. SIAM J. Optim. 17 (3) (2006)
Didier Henrion, Jean B. Lasserre
LMIs for constrained polynomial interpolation with application in trajectory planning. Syst. Control. Lett. 55 (6) (2006)
Didier Henrion, Jean B. Lasserre
Convergent relaxations of polynomial matrix inequalities and static output feedback. IEEE Trans. Autom. Control. 51 (2) (2006)
Jean B. Lasserre
Polynomial Programming: LP-Relaxations Also Converge. SIAM J. Optim. 15 (2) (2005)
Jean B. Lasserre
Erratum to "Generating functions and duality for integer programs": [Discrete Optimization 1 (2) (2004) 167-187]. Discret. Optim. 2 (1) (2005)
Jean B. Lasserre
SOS approximation of polynomials nonnegative on an algebraic set. CDC/ECC (2005)
Jean B. Lasserre, Eduardo S. Zeron
An Alternative Algorithm for Counting Lattice Points in a Convex Polytope. Math. Oper. Res. 30 (3) (2005)
Gérard Fontan, Colette Mercé, Jean-Claude Hennet, Jean B. Lasserre
Hierarchical scheduling for decision support. J. Intell. Manuf. 16 (2) (2005)

Jean B. Lasserre.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jean B. Lasserre