default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean B. Lasserre
Jean-Bernard Lasserre
Person information
- affiliation: LAAS, Toulouse, France
- award (2015): John von Neumann Theory Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j131]Jean B. Lasserre
:
The Moment-SOS hierarchy: Applications and related topics. Acta Numer. 33: 841-908 (2024)- [c36]Yukai Tang, Jean-Bernard Lasserre, Heng Yang:
Uncertainty quantification of set-membership estimation in control and perception: Revisiting the minimum enclosing ellipsoid. L4DC 2024: 286-298 - [i24]Mareike Dressler, Simon Foucart, Etienne de Klerk, Mioara Joldes, Jean-Bernard Lasserre, Yuan Xu:
Optimization-Aided Construction of Multivariate Chebyshev Polynomials. CoRR abs/2405.10438 (2024) - [i23]Jianting Yang, Srecko Ðurasinovic, Jean-Bernard Lasserre, Victor Magron, Jun Zhao:
Verifying Properties of Binary Neural Networks Using Sparse Polynomial Optimization. CoRR abs/2405.17049 (2024) - 2023
- [j130]Matteo Tacchi, Jean-Bernard Lasserre, Didier Henrion:
Stokes, Gibbs, and Volume Computation of Semi-Algebraic Sets. Discret. Comput. Geom. 69(1): 260-283 (2023) - [j129]Didier Henrion, Felix Kirschner, Etienne de Klerk, Milan Korda, Jean-Bernard Lasserre, Victor Magron:
Revisiting Semidefinite Programming Approaches to Options Pricing: Complexity and Computational Perspectives. INFORMS J. Comput. 35(2): 335-349 (2023) - [j128]Jean B. Lasserre:
A modified Christoffel function and its asymptotic properties. J. Approx. Theory 295: 105955 (2023) - [j127]Ngoc Hoang Anh Mai, Victor Magron, Jean B. Lasserre:
A Sparse Version of Reznick's Positivstellensatz. Math. Oper. Res. 48(2): 812-833 (2023) - [j126]Ngoc Hoang Anh Mai, Jean-Bernard Lasserre, Victor Magron:
A hierarchy of spectral relaxations for polynomial optimization. Math. Program. Comput. 15(4): 651-701 (2023) - [j125]Khazhgali Kozhasov, Jean B. Lasserre:
Volumes of Sublevel Sets of Nonnegative Forms and Complete Monotonicity. SIAM J. Appl. Algebra Geom. 7(4): 768-785 (2023) - [i22]Didier Henrion, Milan Korda, Jean-Bernard Lasserre:
Polynomial argmin for recovery and approximation of multivariate discontinuous functions. CoRR abs/2302.06945 (2023) - [i21]Yukai Tang, Jean-Bernard Lasserre, Heng Yang:
Uncertainty Quantification of Set-Membership Estimation in Control and Perception: Revisiting the Minimum Enclosing Ellipsoid. CoRR abs/2311.15962 (2023) - 2022
- [j124]Tong Chen, Jean-Bernard Lasserre, Victor Magron, Edouard Pauwels:
A sublevel moment-SOS hierarchy for polynomial optimization. Comput. Optim. Appl. 81(1): 31-66 (2022) - [j123]Matteo Tacchi, Tillmann Weißer, Jean-Bernard Lasserre, Didier Henrion:
Exploiting Sparsity for Semi-Algebraic Set Volume Computation. Found. Comput. Math. 22(1): 161-209 (2022) - [j122]Khazhgali Kozhasov, Jean-Bernard Lasserre:
Nonnegative forms with sublevel sets of minimal volume. Math. Program. 193(1): 485-498 (2022) - [j121]Shmuel Friedland, Jean-Bernard Lasserre, Lek-Heng Lim, Jiawang Nie:
Special Issue: Polynomial and Tensor Optimization. Math. Program. 193(2): 511-512 (2022) - [j120]Ngoc Hoang Anh Mai, Jean-Bernard Lasserre, Victor Magron:
Positivity certificates and polynomial optimization on non-compact semialgebraic sets. Math. Program. 194(1): 443-485 (2022) - [j119]Jean B. Lasserre:
Homogeneous polynomials and spurious local minima on the unit sphere. Optim. Lett. 16(4): 1105-1118 (2022) - [j118]Jean B. Lasserre:
Optimization on the Euclidean Unit Sphere. SIAM J. Optim. 32(2): 1430-1445 (2022) - [j117]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): 40:1-40:39 (2022) - [j116]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): 42:1-42:26 (2022) - [i20]Ngoc Hoang Anh Mai, Victor Magron, Jean-Bernard Lasserre, Kim-Chuan Toh:
Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant. CoRR abs/2209.06175 (2022) - 2021
- [j115]Edouard Pauwels, Mihai Putinar, Jean-Bernard Lasserre:
Data Analysis from Empirical Moments and the Christoffel Function. Found. Comput. Math. 21(1): 243-273 (2021) - [j114]Jean B. Lasserre, Tillmann Weißer:
Distributionally robust polynomial chance-constraints under mixture ambiguity sets. Math. Program. 185(1-2): 409-453 (2021) - [j113]Jean B. Lasserre:
Connecting optimization with spectral analysis of tri-diagonal matrices. Math. Program. 190(1): 795-809 (2021) - [j112]Yohann de Castro, Fabrice Gamboa, Didier Henrion, Jean-Bernard Lasserre:
Dual optimal design and the Christoffel-Darboux polynomial. Optim. Lett. 15(1): 3-8 (2021) - [j111]Jean B. Lasserre:
The moment-SOS hierarchy and the Christoffel-Darboux kernel. Optim. Lett. 15(6): 1835-1845 (2021) - [j110]Jie Wang, Victor Magron, Jean-Bernard Lasserre:
TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity. SIAM J. Optim. 31(1): 30-58 (2021) - [j109]Jie Wang, Victor Magron, Jean-Bernard Lasserre:
Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension. SIAM J. Optim. 31(1): 114-141 (2021) - [j108]Jean-Bernard Lasserre, Victor Magron, Swann Marx, Olivier Zahm:
Minimizing Rational Functions: A Hierarchy of Approximations via Pushforward Measures. SIAM J. Optim. 31(3): 2285-2306 (2021) - [c35]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: 6300-6305 - [c34]Bachir El Khadir, Jean-Bernard Lasserre, Vikas Sindhwani:
Piecewise-Linear Motion Planning amidst Static, Moving, or Morphing Obstacles. ICRA 2021: 7802-7808 - [c33]Tong Chen, Jean B. Lasserre, Victor Magron, Edouard Pauwels:
Semialgebraic Representation of Monotone Deep Equilibrium Models and Applications to Certification. NeurIPS 2021: 27146-27159 - 2020
- [j107]Jean B. Lasserre, Victor Magron:
Computing the Hausdorff Boundary Measure of Semialgebraic Sets. SIAM J. Appl. Algebra Geom. 4(3): 441-469 (2020) - [c32]Tong Chen, Jean B. Lasserre, Victor Magron, Edouard Pauwels:
Semialgebraic Optimization for Lipschitz Constants of ReLU Networks. NeurIPS 2020 - [i19]Tong Chen, Jean-Bernard Lasserre, Victor Magron, Edouard Pauwels:
Polynomial Optimization for Bounding Lipschitz Constants of Deep Networks. CoRR abs/2002.03657 (2020) - [i18]Jie Wang, Victor Magron, Jean B. Lasserre, Ngoc Hoang Anh Mai:
CS-TSSOS: Correlative and term sparsity for large-scale polynomial optimization. CoRR abs/2005.02828 (2020) - [i17]Bachir El Khadir, Jean-Bernard Lasserre, Vikas Sindhwani:
Piecewise-Linear Motion Planning amidst Static, Moving, or Morphing Obstacles. CoRR abs/2010.08167 (2020)
2010 – 2019
- 2019
- [j106]Cédric Josz, Jean-Bernard Lasserre, Bernard Mourrain:
Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony? Adv. Comput. Math. 45(3): 1401-1437 (2019) - [j105]Jean B. Lasserre, Edouard Pauwels:
The empirical Christoffel function with applications in data analysis. Adv. Comput. Math. 45(3): 1439-1468 (2019) - [j104]Jean B. Lasserre, Youssouf Emin:
Semidefinite Relaxations for Lebesgue and Gaussian Measures of Unions of Basic Semialgebraic Sets. Math. Oper. Res. 44(4): 1477-1493 (2019) - [j103]Jean B. Lasserre:
Volume of Sublevel Sets of Homogeneous Polynomials. SIAM J. Appl. Algebra Geom. 3(2): 372-389 (2019) - [j102]Jean-Bernard Lasserre, Victor Magron:
In SDP Relaxations, Inaccurate Solvers Do Robust Optimization. SIAM J. Optim. 29(3): 2128-2145 (2019) - [c31]Jean B. Lasserre:
Volume of sub-level sets of polynomials. ECC 2019: 1975-1980 - [c30]Florent Bréhard, Mioara Joldes, Jean-Bernard Lasserre:
On Moment Problems with Holonomic Functions. ISSAC 2019: 66-73 - [i16]Jean B. Lasserre:
Connecting optimization with spectral analysis of tri-diagonal matrices. CoRR abs/1907.09784 (2019) - [i15]Jean B. Lasserre:
Simple formula for integration of polynomials on a simplex. CoRR abs/1908.06736 (2019) - [i14]Matteo Tacchi, Carmen Cardozo, Didier Henrion, Jean B. Lasserre:
Approximating regions of attraction of a sparse polynomial differential system. CoRR abs/1911.09500 (2019) - 2018
- [j101]Simon Foucart, Jean B. Lasserre:
Determining projection constants of univariate polynomial spaces. J. Approx. Theory 235: 74-91 (2018) - [j100]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): 1-32 (2018) - [j99]Jean-Bernard Lasserre, Victor Magron:
Optimal Data Fitting: A Moment Approach. SIAM J. Optim. 28(4): 3127-3144 (2018) - 2017
- [j98]Jean B. Lasserre:
Computing Gaussian & exponential measures of semi-algebraic sets. Adv. Appl. Math. 91: 137-163 (2017) - [j97]Jean B. Lasserre:
Representation of Chance-Constraints With Strong Asymptotic Guarantees. IEEE Control. Syst. Lett. 1(1): 50-55 (2017) - [j96]Jean B. Lasserre, Kim-Chuan Toh, Shouguang Yang:
A bounded degree SOS hierarchy for polynomial optimization. EURO J. Comput. Optim. 5(1-2): 87-117 (2017) - [j95]Etienne de Klerk, Jean B. Lasserre, Monique Laurent, Zhao Sun:
Bound-Constrained Polynomial Optimization Using Only Elementary Calculations. Math. Oper. Res. 42(3): 834-853 (2017) - [j94]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): 621-630 (2017) - [c29]Jérémy Rouot, Jean-Bernard Lasserre:
On inverse optimal control via polynomial optimization. CDC 2017: 721-726 - [p1]Edouard Pauwels, Didier Henrion, Jean-Bernard Lasserre:
Positivity Certificates in Optimal Control. Geometric and Numerical Foundations of Movements 2017: 113-131 - [e1]Jean-Paul Laumond, Nicolas Mansard, Jean-Bernard Lasserre:
Geometric and Numerical Foundations of Movements. Springer Tracts in Advanced Robotics 117, 2017, ISBN 978-3-319-51546-5 [contents] - [i13]Jean-Bernard Lasserre, Edouard Pauwels:
The empirical Christoffel function in Statistics and Machine Learning. CoRR abs/1701.02886 (2017) - [i12]Yohann de Castro, Fabrice Gamboa, Didier Henrion, Roxana Hess, Jean-Bernard Lasserre:
Approximate Optimal Designs for Multivariate Polynomial Regression. CoRR abs/1706.04059 (2017) - 2016
- [j93]Jean B. Lasserre:
Lebesgue decomposition in action via semidefinite relaxations. Adv. Comput. Math. 42(5): 1129-1148 (2016) - [j92]Florian Bugarin, Didier Henrion, Jean-Bernard Lasserre:
Minimizing the sum of many rational functions. Math. Program. Comput. 8(1): 83-111 (2016) - [j91]Jean B. Lasserre:
A MAX-CUT formulation of 0/1 programs. Oper. Res. Lett. 44(2): 158-164 (2016) - [j90]Roxana Heß, Didier Henrion, Jean-Bernard Lasserre, Tien Son Pham:
Semidefinite Approximations of the Polynomial Abscissa. SIAM J. Control. Optim. 54(3): 1633-1656 (2016) - [j89]Edouard Pauwels, Didier Henrion, Jean-Bernard Lasserre:
Linear Conic Optimization for Inverse Optimal Control. SIAM J. Control. Optim. 54(3): 1798-1825 (2016) - [j88]Jean B. Lasserre:
Convex Optimization and Parsimony of Lp-balls Representation. SIAM J. Optim. 26(1): 247-273 (2016) - [j87]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): 753-780 (2016) - [c28]Edouard Pauwels, Jean B. Lasserre:
Sorting out typicality with the inverse moment matrix SOS polynomial. NIPS 2016: 190-198 - [i11]Jean-Bernard Lasserre, Edouard Pauwels:
Sorting out typicality with the inverse moment matrix SOS polynomial. CoRR abs/1606.03858 (2016) - 2015
- [j86]Jean-Paul Laumond, Nicolas Mansard, Jean-Bernard Lasserre:
Optimization as motion selection principle in robot action. Commun. ACM 58(5): 64-74 (2015) - [j85]Jean-Bernard Lasserre, Mihai Putinar:
Algebraic-exponential Data Recovery from Moments. Discret. Comput. Geom. 54(4): 993-1012 (2015) - [j84]Jean B. Lasserre:
Level Sets and NonGaussian Integrals of Positively Homogeneous Functions. IGTR 17(1): 1540001:1-1540001:28 (2015) - [j83]Florian Bugarin, Adrien Bartoli, Didier Henrion, Jean-Bernard Lasserre, Jean-José Orteu, Thierry Sentenac:
Rank-Constrained Fundamental Matrix Estimation by Polynomial Global Optimization Versus the Eight-Point Algorithm. J. Math. Imaging Vis. 53(1): 42-60 (2015) - [j82]Adam N. Letchford, Jean B. Lasserre, Pablo A. Parrilo, David Steurer:
The 2013 Newton Institute Programme on polynomial optimization. Math. Program. 151(2): 375-377 (2015) - [j81]Jean B. Lasserre:
Tractable approximations of sets defined with quantifiers. Math. Program. 151(2): 507-527 (2015) - [j80]Jean B. Lasserre:
A generalization of Löwner-John's ellipsoid theorem. Math. Program. 152(1-2): 559-591 (2015) - [j79]Jean B. Lasserre:
Volume of slices and sections of the simplex in closed form. Optim. Lett. 9(7): 1263-1269 (2015) - [j78]Victor Magron, Didier Henrion, Jean-Bernard Lasserre:
Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets. SIAM J. Optim. 25(4): 2143-2164 (2015) - [i10]Yohann de Castro, Fabrice Gamboa, Didier Henrion, Jean B. Lasserre:
Exact solutions to Super Resolution on semi-algebraic domains in higher dimensions. CoRR abs/1502.02436 (2015) - 2014
- [j77]Jean-Paul Laumond, Nicolas Mansard, Jean-Bernard Lasserre:
Optimality in robot motion: optimal versus optimized motion. Commun. ACM 57(9): 82-89 (2014) - [j76]Mehdi Ghasemi, Jean B. Lasserre, M. Marshall:
Lower bounds on the global minimum of a polynomial. Comput. Optim. Appl. 57(2): 387-402 (2014) - [j75]Vaithilingam Jeyakumar, Jean B. Lasserre, Guoyin Li:
On Polynomial Optimization Over Non-compact Semi-algebraic Sets. J. Optim. Theory Appl. 163(3): 707-718 (2014) - [j74]Jean B. Lasserre:
New approximations for the cone of copositive matrices and its dual. Math. Program. 144(1-2): 265-276 (2014) - [j73]Jean B. Lasserre:
Erratum to: On convex optimization without convex representation. Optim. Lett. 8(5): 1795-1796 (2014) - [j72]Victor Magron, Didier Henrion, Jean-Bernard Lasserre:
Approximating Pareto curves using semidefinite relaxations. Oper. Res. Lett. 42(6-7): 432-437 (2014) - [j71]Mathieu Claeys, Denis Arzelier, Didier Henrion, Jean-Bernard Lasserre:
Measures and LMIs for Impulsive Nonlinear Optimal Control. IEEE Trans. Autom. Control. 59(5): 1374-1379 (2014) - [j70]Vito Cerone, Jean-Bernard Lasserre, Dario Piga, Diego Regruto:
A Unified Framework for Solving a General Class of Conditional and Robust Set-Membership Estimation Problems. IEEE Trans. Autom. Control. 59(11): 2897-2909 (2014) - [c27]Edouard Pauwels, Didier Henrion, Jean-Bernard Lasserre:
Inverse optimal control with polynomial optimization. CDC 2014: 5581-5586 - [i9]Edouard Pauwels, Didier Henrion, Jean-Bernard Lasserre:
Inverse optimal control with polynomial optimization. CoRR abs/1403.5180 (2014) - [i8]Victor Magron, Didier Henrion, Jean-Bernard Lasserre:
Approximating Pareto Curves using Semidefinite Relaxations. CoRR abs/1404.4772 (2014) - [i7]Vito Cerone, Jean-Bernard Lasserre, Dario Piga, Diego Regruto:
A unified framework for solving a general class of conditional and robust set-membership estimation problems. CoRR abs/1408.0532 (2014) - 2013
- [j69]Jean B. Lasserre:
Recovering an Homogeneous Polynomial from Moments of Its Level Set. Discret. Comput. Geom. 50(3): 673-678 (2013) - [j68]Jean B. Lasserre, Tung Phan Thanh:
Convex underestimators of polynomials. J. Glob. Optim. 56(1): 1-25 (2013) - [j67]Jean-Bernard Lasserre, Monique Laurent, Bernard Mourrain, Philipp Rostalski, Philippe Trebuchet:
Moment matrices, border bases and real radical computation. J. Symb. Comput. 51: 63-85 (2013) - [j66]Cordian Riener, Thorsten Theobald, Lina Jansson Andrén, Jean B. Lasserre:
Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization. Math. Oper. Res. 38(1): 122-141 (2013) - [j65]Jean B. Lasserre:
Inverse Polynomial Optimization. Math. Oper. Res. 38(3): 418-436 (2013) - [j64]Jean B. Lasserre:
A Lagrangian Relaxation View of Linear and Semidefinite Hierarchies. SIAM J. Optim. 23(3): 1742-1756 (2013) - [c26]Jean B. Lasserre:
A generalization of the Löwner-John's ellipsoid theorem. CDC 2013: 415-420 - [c25]Jean B. Lasserre:
A Lagrangian relaxation view of linear and semidefinite hierarchies. CDC 2013: 1966-1970 - [c24]Mathieu Claeys, Denis Arzelier, Didier Henrion, Jean-Bernard Lasserre:
Moment LMI approach to LTV impulsive control. CDC 2013: 5810-5815 - 2012
- [b1]Roberto Cominetti, Francisco Facchinei, Jean B. Lasserre:
Modern Optimization Modelling Techniques. Advanced courses in mathematics : CRM Barcelona, Birkhäuser 2012, ISBN 978-3-0348-0290-1, pp. I-IX, 1-269 - [j63]Nick Gravin, Jean B. Lasserre, Dmitrii V. Pasechnik, Sinai Robins:
The Inverse Moment Problem for Convex Polytopes. Discret. Comput. Geom. 48(3): 596-621 (2012) - [j62]Jean B. Lasserre:
The existence of Gaussian cubature formulas. J. Approx. Theory 164(5): 572-585 (2012) - [j61]Jean B. Lasserre, Tung Phan Thanh:
A "joint + marginal" heuristic for 0/1 programs. J. Glob. Optim. 54(4): 729-744 (2012) - [j60]Rida Laraki, Jean B. Lasserre:
Semidefinite programming for min-max problems and games. Math. Program. 131(1-2): 305-332 (2012) - [j59]Didier Henrion, Jean B. Lasserre:
Inner Approximations for Polynomial Matrix Inequalities and Robust Stability Regions. IEEE Trans. Autom. Control. 57(6): 1456-1467 (2012) - [c23]Mathieu Claeys, Denis Arzelier, Didier Henrion, Jean-Bernard Lasserre:
Measures and LMI for impulsive optimal control with applications to space rendezvous problems. ACC 2012: 161-166 - 2011
- [j58]Jean B. Lasserre:
Min-max and robust polynomial optimization. J. Glob. Optim. 51(1): 1-10 (2011) - [j57]Jean B. Lasserre:
On convex optimization without convex representation. Optim. Lett. 5(4): 549-556 (2011) - [j56]Jean B. Lasserre:
A New Look at Nonnegativity on Closed Sets and Polynomial Optimization. SIAM J. Optim. 21(3): 864-885 (2011) - [c22]Jean B. Lasserre:
Inverse polynomial optimization. CDC/ECC 2011: 2794-2799 - [c21]Jean B. Lasserre, Tung Phan Thanh:
Convex underestimators of polynomials. CDC/ECC 2011: 7194-7199 - [i6]Florian Bugarin, Didier Henrion, Jean B. Lasserre:
Minimizing the sum of many rational functions. CoRR abs/1102.4954 (2011) - [i5]Cordian Riener, Thorsten Theobald, Lina Jansson Andrén, Jean B. Lasserre:
Exploiting symmetries in SDP-relaxations for polynomial optimization. CoRR abs/1103.0486 (2011) - [i4]Didier Henrion, Jean B. Lasserre:
Inner approximations for polynomial matrix inequalities and robust stability regions. CoRR abs/1104.4905 (2011) - [i3]Nick Gravin, Jean B. Lasserre, Dmitrii V. Pasechnik, Sinai Robins:
The inverse moment problem for convex polytopes. CoRR abs/1106.5723 (2011) - 2010
- [j55]Jean B. Lasserre:
Certificates of convexity for basic semi-algebraic sets. Appl. Math. Lett. 23(8): 912-916 (2010) - [j54]Jean B. Lasserre:
On representations of the feasible set in convex optimization. Optim. Lett. 4(1): 1-5 (2010) - [j53]Jean B. Lasserre:
A "Joint+Marginal" Approach to Parametric Polynomial Optimization. SIAM J. Optim. 20(4): 1995-2022 (2010) - [j52]Jean B. Lasserre, Mihai Putinar:
Positivity and Optimization for Semi-Algebraic Functions. SIAM J. Optim. 20(6): 3364-3383 (2010) - [c20]Jean B. Lasserre, Tung Phan Thanh:
A "joint+marginal" algorithm for polynomial optimization. CDC 2010: 3871-3876
2000 – 2009
- 2009
- [j51]Jean B. Lasserre:
Moments and sums of squares for polynomial optimization and related problems. J. Glob. Optim. 45(1): 39-61 (2009) - [j50]Jean B. Lasserre:
The K-moment problem with densities. Math. Program. 116(1-2): 321-341 (2009) - [j49]Jean B. Lasserre:
Convex sets with semidefinite representation. Math. Program. 120(2): 457-477 (2009) - [j48]Didier Henrion, Jean-Bernard Lasserre, Johan Löfberg:
GloptiPoly 3: moments, optimization and semidefinite programming. Optim. Methods Softw. 24(4-5): 761-779 (2009) - [j47]Jean B. Lasserre:
Convexity in SemiAlgebraic Geometry and Polynomial Optimization. SIAM J. Optim. 19(4): 1995-2014 (2009) - [j46]Didier Henrion, Jean B. Lasserre, Carlo Savorgnan:
Approximate Volume and Integration for Basic Semialgebraic Sets. SIAM Rev. 51(4): 722-743 (2009) - [j45]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): 2685-2700 (2009) - [c19]Carlo Savorgnan, Jean B. Lasserre, Moritz Diehl:
Discrete-time stochastic optimal control via occupation measures and moment relaxations. CDC 2009: 519-524 - [c18]Didier Henrion, Jean B. Lasserre, Carlo Savorgnan:
POCP: A package for polynomial optimal control problems. ECC 2009: 1173-1178 - [i2]Jean B. Lasserre, Eduardo S. Zeron:
Certificates and relaxations for integer programming and the semi-group membership problem. CoRR abs/0905.1608 (2009) - 2008
- [j44]Jean B. Lasserre, Monique Laurent, Philipp Rostalski:
Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals. Found. Comput. Math. 8(5): 607-647 (2008) - [j43]Jean B. Lasserre:
A semidefinite programming approach to the generalized problem of moments. Math. Program. 112(1): 65-92 (2008) - [j42]Dimitris Bertsimas, Xuan Vinh Doan, Jean B. Lasserre:
Approximating integrals of multivariate exponentials: A moment approach. Oper. Res. Lett. 36(2): 205-210 (2008) - [j41]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): 1643-1666 (2008) - [c17]Didier Henrion, Jean B. Lasserre, Carlo Savorgnan:
Nonlinear optimal control synthesis via occupation measures. CDC 2008: 4749-4754 - [c16]Jean B. Lasserre, Monique Laurent, Philipp Rostalski:
Computing the real variety of an ideal: a real algebraic and symbolic-numeric algorithm. SAC 2008: 1845-1846 - [i1]Rida Laraki, Jean B. Lasserre:
Semidefinite programming for N-Player Games. CoRR abs/0810.3150 (2008) - 2007
- [j40]Jean B. Lasserre:
A Sum of Squares Approximation of Nonnegative Polynomials. SIAM Rev. 49(4): 651-669 (2007) - [c15]Jean B. Lasserre:
Semidefinite programming for gradient and Hessian computation in maximum entropy estimation. CDC 2007: 3060-3064 - [c14]Jean B. Lasserre, Eduardo S. Zeron:
Simple Explicit Formula for Counting Lattice Points of Polyhedra. IPCO 2007: 367-381 - 2006
- [j39]Jean B. Lasserre:
Robust global optimization with polynomials. Math. Program. 107(1-2): 275-293 (2006) - [j38]Didier Henrion, Jean B. Lasserre:
LMIs for constrained polynomial interpolation with application in trajectory planning. Syst. Control. Lett. 55(6): 473-477 (2006) - [j37]Jean B. Lasserre:
A Sum of Squares Approximation of Nonnegative Polynomials. SIAM J. Optim. 16(3): 751-765 (2006) - [j36]Jean B. Lasserre:
Convergent SDP-Relaxations in Polynomial Optimization with Sparsity. SIAM J. Optim. 17(3): 822-843 (2006) - [j35]Didier Henrion, Jean B. Lasserre:
Convergent relaxations of polynomial matrix inequalities and static output feedback. IEEE Trans. Autom. Control. 51(2): 192-202 (2006) - [c13]Jean B. Lasserre:
Convergent SDP-Relaxations for Polynomial Optimization with Sparsity. ICMS 2006: 263-272 - 2005
- [j34]Jean B. Lasserre:
Erratum to "Generating functions and duality for integer programs": [Discrete Optimization 1 (2) (2004) 167-187]. Discret. Optim. 2(1): 1 (2005) - [j33]Gérard Fontan, Colette Mercé, Jean-Claude Hennet, Jean B. Lasserre:
Hierarchical scheduling for decision support. J. Intell. Manuf. 16(2): 235-242 (2005) - [j32]Jean B. Lasserre, Eduardo S. Zeron:
An Alternative Algorithm for Counting Lattice Points in a Convex Polytope. Math. Oper. Res. 30(3): 597-614 (2005) - [j31]Jean B. Lasserre:
Polynomial Programming: LP-Relaxations Also Converge. SIAM J. Optim. 15(2): 383-393 (2005) - [j30]Jean B. Lasserre:
Sum of Squares Approximation of Polynomials, Nonnegative on a Real Algebraic Set. SIAM J. Optim. 16(2): 610-628 (2005) - [c12]Jean B. Lasserre, Christophe Prieur, Didier Henrion:
Nonlinear optimal control: approximations via moments and LMI-relaxations. CDC/ECC 2005: 1648-1653 - [c11]Jean B. Lasserre:
SOS approximation of polynomials nonnegative on an algebraic set. CDC/ECC 2005: 5837-5841 - 2004
- [j29]Jean B. Lasserre:
The Integer Hull of a Convex Rational Polytope. Discret. Comput. Geom. 32(1): 129-139 (2004) - [j28]Jean B. Lasserre:
A discrete Farkas lemma. Discret. Optim. 1(1): 67-75 (2004) - [j27]Jean B. Lasserre:
Generating functions and duality for integer programs. Discret. Optim. 1(2): 167-187 (2004) - [j26]Jean B. Lasserre:
Integer programming, Barvinok's counting algorithm and Gomory relaxations. Oper. Res. Lett. 32(2): 133-137 (2004) - [j25]Jean B. Lasserre:
Characterizing polynomials with roots in a semialgebraic set. IEEE Trans. Autom. Control. 49(5): 727-731 (2004) - [c10]Didier Henrion, Denis Arzelier, Dimitri Peaucelle, Jean-Bernard Lasserre:
On parameter-dependent Lyapunov functions for robust stability of linear systems. CDC 2004: 887-892 - 2003
- [j24]Jean B. Lasserre, Eduardo S. Zeron:
On Counting Integral Points in a Convex Rational Polytope. Math. Oper. Res. 28(4): 853-870 (2003) - [j23]Didier Henrion, Jean B. Lasserre:
GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi. ACM Trans. Math. Softw. 29(2): 165-194 (2003) - [c9]Jean B. Lasserre:
Characterizing polynomials with roots in a semi-algebraic set. CDC 2003: 3485-3488 - [c8]Jean B. Lasserre:
A Discrete Farkas Lemma. ICCSA (1) 2003: 273-281 - [c7]Jean B. Lasserre:
The Integer Hull of a Convex Rational Polytope. ICCSA (3) 2003: 866-875 - 2002
- [j22]Jean B. Lasserre:
Semidefinite Programming vs. LP Relaxations for Polynomial Programming. Math. Oper. Res. 27(2): 347-360 (2002) - [j21]Jean B. Lasserre, Eduardo S. Zeron:
Solving the knapsack problem via Z-transform. Oper. Res. Lett. 30(6): 394-400 (2002) - [j20]Jean B. Lasserre:
An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs. SIAM J. Optim. 12(3): 756-769 (2002) - [j19]Konstantin Avrachenkov, Jean B. Lasserre:
Analytic perturbation of Sylvester matrix equations. IEEE Trans. Autom. Control. 47(7): 1116-1119 (2002) - [c6]Didier Henrion, Jean-Bernard Lasserre:
GloptiPoly: global optimization over polynomials with Matlab and SeDuMi. CDC 2002: 747-752 - [c5]Didier Henrion, Jean B. Lasserre:
Solving Global Optimization Problems over Polynomials with GloptiPoly 2.1. COCOS 2002: 43-58 - 2001
- [j18]Jean B. Lasserre, Eduardo S. Zeron:
A Laplace transform algorithm for the volume of a convex polytope. J. ACM 48(6): 1126-1140 (2001) - [j17]Jean B. Lasserre:
Global Optimization with Polynomials and the Problem of Moments. SIAM J. Optim. 11(3): 796-817 (2001) - [j16]Jean B. Lasserre, Konstantin Avrachenkov:
The Multi-Dimensional Version of ∫b a xp dx. Am. Math. Mon. 108(2): 151-154 (2001) - [j15]Jean-Pierre Quadrat, Jean B. Lasserre, Jean-Baptiste Hiriart-Urruty:
Pythagoras' Theorem for Areas. Am. Math. Mon. 108(6): 549-551 (2001) - [j14]Jean B. Lasserre:
A Quick Proof for the Volume of n-Balls. Am. Math. Mon. 108(8): 768-769 (2001) - [c4]Jean B. Lasserre:
An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs. IPCO 2001: 293-303 - 2000
- [j13]Jean B. Lasserre:
Why the logarithmic barrier function in convex and linear programming? Oper. Res. Lett. 27(4): 149-152 (2000) - [j12]Onésimo Hernández-Lerma, Jean B. Lasserre:
Zero-Sum Stochastic Games in Borel Spaces: Average Payoff Criteria. SIAM J. Control. Optim. 39(5): 1520-1539 (2000) - [c3]Konstantin E. Avrachenkov, Jean B. Lasserre:
Analytic perturbation of Sylvester and Lyapunov matrix equations. CDC 2000: 1968-1973 - [c2]Jean B. Lasserre:
Convergent LMI relaxations for nonconvex quadratic programs. CDC 2000: 5041-5046
1990 – 1999
- 1999
- [j11]Jean-Bernard Lasserre:
Sample-path average optimality for Markov control processes. IEEE Trans. Autom. Control. 44(10): 1966-1971 (1999) - 1998
- [j10]Stéphane Dauzère-Pérès, W. Roux, Jean B. Lasserre:
Multi-resource shop scheduling with resource flexibility. Eur. J. Oper. Res. 107(2): 289-305 (1998) - [j9]Onésimo Hernández-Lerma, Jean B. Lasserre:
Approximation Schemes for Infinite Linear Programs. SIAM J. Optim. 8(4): 973-988 (1998) - 1997
- [j8]Stéphane Dauzère-Pérès, Jean-Bernard Lasserre:
Lot Streaming in Job-Shop Scheduling. Oper. Res. 45(4): 584-595 (1997) - [j7]Jean B. Lasserre:
Tight bounds for the trace of a matrix product. IEEE Trans. Autom. Control. 42(4): 578-581 (1997) - 1995
- [j6]Jean B. Lasserre:
A new Farkas lemma for positive semidefinite matrices. IEEE Trans. Autom. Control. 40(6): 1131-1133 (1995) - [j5]Jean B. Lasserre:
A trace inequality for matrix product. IEEE Trans. Autom. Control. 40(8): 1500-1501 (1995) - 1994
- [j4]Arie Hordijk, Jean B. Lasserre:
Linear programming formulation of MDPs in countable state space: The multichain case. Math. Methods Oper. Res. 40(1): 91-108 (1994) - 1993
- [j3]Jean B. Lasserre:
Reachable, controllable sets and stabilizing control of constrained linear systems. Autom. 29(2): 531-536 (1993) - 1992
- [c1]Jean B. Lasserre, Maurice Queyranne:
Generic Scheduling Polyhedra and a New Mixed-Integer Formulation for Single-Machine Scheduling. IPCO 1992: 136-149
1980 – 1989
- 1985
- [j2]Jean B. Lasserre, C. Bes, François Roubellat:
Technical Note - The Stochastic Discrete Dynamic Lot Size Problem: An Open-Loop Solution. Oper. Res. 33(3): 684-689 (1985) - 1981
- [j1]Jean B. Lasserre:
An economic interpretation of exact penalty functions using sensitivity analysis. Oper. Res. Lett. 1(1): 39-40 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-21 23:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
