Jean-Bernard Lasserre

2024

Lasserre J.B. (2024) The Christoffel function: Applications, connections and extensions, Num. Alg. Control Optim.
U. Tang, J.B. Lasserre, H. Yang (2024). Uncertainty Quantification of Set-Membership Estimation in Control and Perception: Proceedings of Machine Learning Research 242: 286--298, (+ oral presentation at, 6th Annual Learning for Dynamics & Control Conference (L4DC), University of Oxford, July 2024)
Lasserre J.B., Yuan Xu (2024). A generalized Pell's equation for a class of multivariate orthogonal polynomials, Trans. Amer. Math. Soc.
Lasserre J.B. (2024) Chebyshev and equilibrium measure vs Bernstein and Lebesgue measure, Proc. Amer. Math. Soc.
Ducharlet K., Travé-Massuyès L., Lasserre J.B., Le Lann M.-V., Miloudi Y. (2024) Leveraging the Christoffel function for outlier detection in data streams, Int. J. Data Sci. Analytics
Lasserre J.B. (2024) The Moment SoS Hierarchy: Applications and Related Topics, Acta Numerica 33, pp. 841--908

2023

Kozhasov K., Lasserre J.B. (2023) V olumes of Sublevel Sets of Nonnegative Forms and Complete Monotonicity, SIAM J. Appl. Alg. Geom. 7(4)
Ngoc Hoang Anh Mai, Lasserre J.B., Magron V. (2023) A hierarchy of spectral relaxations for polynomial optimization, Math. Program. Comput. 15, pp. 651--701.
Tacchi M., Lasserre J.B., Henrion D. (2023) Stokes, Gibbs and volume computation of semi-algebraic sets, Discrete & Comput. Geom. 69, pp. 260--283.
Lasserre J.B. (2023) Polynomial Optimization, Certificates of Positivity, and Christoffel Function, in: Polynomial Optimization , Moments and Applications, M. Kocvara, B. Mourrain and C. Riener (Eds.), volume 206, Springer Nature Switzerland, Cham, pp. 1-22.
Henrion D., Kirschner F., de Klerk E., Korda M., Lasserre J.B., Magron V. (2023) Revisiting semidefinite approaches to option pricing: Complexity and computational perspectives, INFORMS Journal on Computing 35(2), pp. 335--349.
Lasserre J.B. (2023) Pell's equation, sum-of-squares and equilibrium measures on a compact set , Comptes Rendus Mathématique 361, pp. 935--952.
Lasserre J.B. (2023) A modified Christoffel function and its asymptotic properties, J. Approximation Theory 295.
Lasserre, J.B. (2023). Moment-SOS Hierarchies. In: Pardalos, P.M., Prokopyev, O.A. (eds) Encyclopedia of Optimization. Springer, Cham. https://doi.org/10.1007/978-3-030-54621-2_740-1
Le Franc A., Magron V., Lasserre J.B., Ruiz M., Panciatici P. (2023) Minimal sparsity for second order Moment-SOS relaxations of the AC-OPF problem, IEEE Trans. Power Systems 39(3), pp. 5408--5415.

2022

Lasserre J.B. (2022) Moment-SOS Hierarchies, in P.M. Pardalos and O.A. Prokopyev (eds.) Encyclopedia of Optimization, Springer Cham
Wang J., Magron V., Lasserre J.B., Ngoc Hoang Anh Mai (2022). CS-TSSOS: Correlative and term sparsity for large-scale polynomial optimization, ACM Trans. Math. Software 48 (4), art. 42, pp. 1--26.
Korda M., Henrion D., Lasserre J.B. (2022) Moments and convex optimization for analysis and control of nonlinear PDEs, In Handbook of Numerical Analysis: Numerical Control: Part A, E. Zuazua and E.Trélat Eds., vol 23, pp. 339--366, Elsevier, 2022.
Henrion D., Lasserre J.B. (2022) Graph recovery from incomplete moment information. Constructive Approximation 56, pp. 165--187
Ngoc Hoang Anh Mai, Magron V., Lasserre J.B. (2022) A Sparse version of Reznick Positivstellensatz, Math. Oper. Research (2022).
Tong Chen, Lasserre J.B., Magron V., Pauwels E. (2022) A sublevel moment-SOS hierarchy for polynomial optimization, Comput. Optim. Appl. 81, pp. 31--66
Lasserre J.B. (2022) Homogeneous polynomials and spurious local minima on the unit sphere , Optim. Letters. 16, pp. 1105--1118
Kozhasov K., Lasserre J.B. (2022) Nonnegative forms with sublevels sets of minimum volume, Math. Program. Ser. A. 193, pp. 485--498
Lasserre J.B. Optimization on the unit sphere. SIAM J. Optim. 32(2), pp. 1430--1445
Hoang Mai, Lasserre J.B., Magron (2022) V. Positivity certificates and polynomial optimization on non-compact semialgebraic sets , Math. Program. Sér. A. 194, pp. 443--485
Lasserre J.B. (2022) On the Christoffel function and classification in data analysis. Comptes Rendus Mathématique 360, pp. 919--928
Lasserre J.B. (2022) A disintegration of the Christoffel function. Comptes Rendus Mathématique 360, pp. 1071--1079
Wang Jie, Magron V., , Lasserre J.B. (2022) Certifying global optimality of AC-OPF optimal solutions via sparse polynomial optimization, Electric Power Systems Research 213,
Ngoc Hoang Anh Mai, Lasserre J.B., Magron V., Wang J. (2022) Exploiting constant trace property in large scale polynomial optimization, ACM Trans. Math. Software 48 (4), art. 40, pp. 1--39.

2021

Chen Tong, Lasserre J.B., Magron V., Pauwels E. (2021) Semialgebraic representation of monotone deep equilibrium models and application to certification. NEURIPS 2021
Tacchi M., Weisser T., Lasserre J.B., Henrion D. (2021) Exploiting sparsity in semi-algebraic set volume computation . Found. Comput. Math. 22, pp. 161--209.
Wang Jie, Magron V., Lasserre J.B. (2021) TSSOS: A Moment-SOS hierarchy that exploits term sparsity , SIAM J. Optim 31(1), pp. 30--58.
Wang Jie, Magron V., Lasserre J.B. (2021) Chordal-TSSOS: A Moment-SOS hierarchy that exploits term sparsity with chordal extension , SIAM J. Optim 31(1), pp. 114--141
Lasserre J.B., T. Weisser (2021). Distributionally robust polynomial chance-constraints under mixture ambiguity sets , Math. Program. Sér. A 185 (1-2), pp. 409--453.
de Castro Y., Gamboa F., Henrion D., Lasserre J.B. (2021). Dual optimal design and the Christoffel-Darboux polynomial , Optim. Letters 15, pp. 3--8.
Pauwels E., Putinar M., Lasserre J.B. (2021). Data analysis from emprical moments and the Christoffel function , Found. Comput. Math. 21, pp. 243--273.
Lasserre J.B. (2021). The moment-SOS hierarchy and the Christoffel-Darboux kernel . Optim. Letters 15, pp. 1835--1845.
Lasserre J.B. (2021). Simple formula for integration of polynomials on a simplex , BIT Numerical Mathematics 61, pp. 523--533
Lasserre J.B. (2021) Connecting optimization with spectral analysis of tri-diagonal matrices, Math. Program. Sér. A 190, pp. 795--809
Marx S., Pauwels E., Weisser T., Henrion D., Lasserre J.B. (2021) Semi-Algebraic approximation using Christoffel-Darboux kernel, Constr. Approx. 54, pp. 391--429.
El Khadir B., Lasserre J.B., Sindhwani (2021). Piecewise-Linear Motion Planning amidst Static, Moving, or Morphing Obstacles, IEEE International Conference on Robotics & Automation (ICRA 2021), Xi'an, China, May-June 2021
Lasserre J.B., Magron V., Marx S., Zham O. (2021) Minimizing rational functions: A hierarchy of approximations via pushforward measures. SIAM J. Optim. 31(3), pp. 2285--2306

2020

Marx S., Weisser T., Henrion D., Lasserre J.B. (2020) A moment approach for entropy solutions to nonlinear hyperbolic PDEs , Math. Control Related Fields 10 (1), pp. 113--140.
Lasserre J.B, Magron V. (2020) Co mputing the Hausdorff boundary measure of semi-algebraic sets, SIAM J. Appl. Alg. Geom. 4 (3), pp. 441--469
Tong Chen, Lasserre J.B., Pauwels E., Magron V. Semi-algebraic optimization for Lipschitz constants of ReLU networks. Conference on Neural Information Processing Systems, Vancouver, December 2020

2019

de Castro Y., Gamboa F., Henrion D., Hess R., Lasserre J.B. (2019) Approximate Optimal Designs for Multivariate Polynomial Regression, The Annals of Statistics 47, pp. 127--155
Lasserre J.B. (2019) Volume of sublevel sets of homogeneous polynomials, SIAM J. Appl. Algebra Geometry 3, pp. 372--389.
Lasserre J.B., Putinar M. (2019) Positive Functionals and Hessenberg Matrices , Proc. Amer. Math. Soc. 147, pp. 1097--1108.
Lasserre J.B., Pauwels E. (2019) The empirical Christoffel function with applications in data analysis, Advances Comp. Math. 45, pp. 1439--1468
Josz C., Lasserre J.B., Mourrain B. (2019) Sparse polynomial interpolation: sparse recovery, super resolution, or Prony? Advances Comp. Math. 45, pp. 1401--1437
Lasserre J.B. (2019) The Moment-SOS Hierarchy, In Proceedings of the International Congress of Mathematicians (ICM 2018), vol 4, B. Sirakov, P. Ney de Souza and M. Viana (Eds.), World Scientific, 2019, pp. 3773--3794
Bréhard F., Lasserre J.B., Joldes Mioara (2019) On moment problem with holonomic functions, In Proceedings ISSAC'2019 of the 2019 International Symposium on Symbolic and Algebraic Computation, Beijing, August 2019, ACM, pp. 66--73.
Lasserre J.B., Magron V. (2019) In SDP relaxations, inaccurate solvers do robust optimization , SIAM J. Optim. 29, pp. 2128--2145
Foucart S., Lasserre J.B. (2019) Computation of Chebyshev polynomials on unions of intervals , Comput. Methods & Function Theory 19, pp. 625--641
Lasserre J.B., Emin Y (2019). Semidefinite relaxations for Lebesgue and Gaussian measures of unions of basic semi-algebraic sets, Math. Oper. Res. 44, pp. 1477--1493

2018

Weisser T., Lasserre J.B., Kim Toh (2018) Sparse-BSOS : A bounded degree SOS hierarchy for large scale polynomial optimization with sparsity , Math. Program. Computation 10, pp. 1--32.
Lasserre J.B., Magron V. (2018) Optimal data fitting: A moment approach , SIAM J. Optim. 28, pp. 3127--3144
Foucart S., Lasserre J.B. (2018) Determining projection constants of univariate polynomial spaces , J. Approx. Theory 235, pp. 74--91

2017

De Klerk E., Lasserre J.B., M. Laurent, Sun Zhao (2017) Bound-Constrained Polynomial Optimization Using Only Elementary Calculations , Math. Operations Research 42, pp. 834--853.
De Castro Y., Gamboa F., Henrion D., Lasserre J.B. (2017) Exact solutions to Super Resolution on semi-algebraic domains in higher dimensions, IEEE Trans. Info. Theory 63, pp. 621--630.
Lasserre J.B. (2017) Computing Gaussian & exponential measures of semi-algebraic sets , Advances Applied Mathematics 91, pp. 137--163.
Lasserre J.B. , Kim-Chuan Toh, Shouguang Yang (2017) A bounded degree SOS hierarchy for polynomial optimization, European J. Comput. Optim. 5, pp. 87--117.
Chin E., Lasserre J.B. , Sukumar N. (2017) Modeling crack discontinuities without element partitioning in the extended finite element method, Int. J. Num. Methods Eng. 110, pp. 1201--1048.
Lasserre J.B. (2017) Representation of chance-constraints with strong asymptotic properties, IEEE Control Systems Letters 1, pp. 50--55.

2016

Lasserre J.B. (2016) Lebesgue decomposition in action via semidefinite relaxations , Adv. Comput. Math. 42 pp. 1129--1148.
Pauwels E., Henrion D., Lasserre J.B. (2016) Linear Conic Optimization for Inverse Optimal Control, SIAM J. Control & Optim. 54 pp. 1798--1825.
Lasserre J.B., Pauwels E. (2016) Sorting out typicality via the inverse moment matrix SOS polynomial, In Advances in Neural Information Processing Systems 29 (NIPS 2016, Barcelona), D.D. Lee and M. Sugiyama and U.V. Luxburg and I. Guyon and R. Garnett, Eds., Curran Associates, Inc. 2016, pp. 190—198.
Lasserre J.B. (2016) Convex optimization and parsimony of Lp balls representation, SIAM J. Optim. 26 pp. 247--273.
Jeyakumar V, Lasserre J.B., G. Li, Tien Son Pham (2016) Convergent semidefinite relaxations for global bilevel polynomial optimization problems, SIAM J. Optim. 26 pp. 753--780.
Hess R., Henrion D., Lasserre J.B., Tien Son Pham (2016) Semidefinite approximations of the polynomial abscissa, SIAM J. Control & Optim. 54 pp. 1633--1656.
Bugarin F., Henrion D., Lasserre J.B. (2016) Minimizing the sum of many rational functions, Math. Programming Comput. 8 pp. 83--111.
Serra R., Arzelier D., Joldes M., Lasserre J.B., Rondepierre A., Salvy B. (2016) Fast and Accurate Computation of Orbital Collision Probability for Short-Term Encounters, J. Guidance, Control & Dynamics 39 pp. 1--13.
Lasserre J.B. (2016) A MAX-CUT formulation of 0/1 programs , Oper. Res. Letters 44 pp. 158--164.

2015

Magron V., Henrion D., Lasserre J.B. (2015) Semidefinite approximations of projections and polynomial images of semi-algebraic sets SIAM J. Optim. 25 pp. 2143--2164.
Chin E.B., Lasserre J.B., Sukumar N. (2015) Numerical integration of homogeneous functions on convex and nonconvex polygons and polyhedra Comput. Mech. 56 pp. 967--981.
Lasserre J.B., Putinar M. (2015) Algebraic-exponential Data Recovery from Moments Discrete & Comput. Geom. 54 pp. 993--1012.
Lasserre J.B. (2015) Volume of slices and sections of the simplex in closed form Optim. Letters 9, No 7, pp. 1263----1269.
Bugarin F., Bartoli A., Henrion D., Lasserre J.B., Orteu J.J., Sentenac T. (2015) Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm J. Math. Imaging & Vision 53, No1, pp. 42--60.
Laumond J.-P., Mansard N., Lasserre J.B. (2015) Optimization as motion selection principle in robot action Communications of the ACM 58, No 5 pp. 64--74.
Lasserre J.B. (2015) A generalization of Löwner-John's ellipsoid theorem Math. Program. 152, No 1 pp. 559--591.
Lasserre J.B. (2015) Tractable approximations of sets defined with quantifiers Math. Programming 151 pp. 507--527.
Lasserre J.B. (2015) Level sets and non Gaussian integrals of positively homogeneous functions Int. Game Theory Review 17 No 1,
Lasserre J.B. (2015) Moments and Legendre-Fourier Series for Measures supported on Curves SIGMA 11 No 077, 10 pages.

2014

Claeys M., Arzelier D., Henrion D., Lasserre J.B. (2014) Measures and LMIs for impulsive nonlinear optimal control IEEE Trans. Aut. Control 59, pp. 1374--1379.
Jeyakumar V., Lasserre J.B., Li G. (2014) On polynomial optimization over non-compact semi-algebraic sets J. Optim. Theor. Appl. 163, pp. 707--718.
Henrion D., Lasserre J.B., Mevissen M. (2014) Mean squared error minimization for inverse moment problems Appl. Math. Optim. 70, pp. 83--110.
Cerone V., Lasserre J.B., Piga D., Regruto, D. (2014) A unified framework for solving a general class of conditional and robust set-membership estimation problems IEEE Trans Auto. Control 59, pp. 2897--2909.
Magron V., Henrion D., Lasserre J.B. (2014) Approximating Pareto curves using semidefinite relaxations Operations Res. Letters 42, pp. 432--4437.
Lasserre J.B. (2014) New approximations for the cone of copositive matrices and its dual Math. Program. 144, pp. 265--276.
Laumond J.-P., N. Mansard, J.B. Lasserre (2014) Optimality in Robot Morion: Optimal Versus Optimized Motion Communications of the ACM 57, pp. 82--89.
Ghasemi, M., Lasserre J.B., Marshall M. (2014) Lower bounds on the global minimum of a polynomial Comput. Optim. Appl. 57, pp. 387--402.

2013

Lasserre J.B. (2013)  Th e K-moment problem for continuous functionals Trans. Amer. Math. Soc. 365, pp. 2489--2504.
Lasserre J.B. (2013) Borel measures with a density on a compact semi-algebraic set Archiv. der Mathematik 101, pp. 361--371.
Lasserre J.B. (2013)  Inverse polynomial optimization Math. Oper. Res. 38, pp. 418--436
Lasserre J.B. (2013)  Recovering an homogeneous polynomials from moments of its levels set Discrete & Comput. Geom. 50, pp. 673--678
Lasserre J.B. (2013) A Lagrangian relaxation view of linear and semidefinite hierarchies SIAM J. Optim. 23, pp. 1742--1756
Riener C., Theobald T., Jansson A.L., Lasserre J.B. (2013)  Exploiting symmetries in SDP-relaxations for polynomial optimization Math. Oper. Res. 38, pp. 122--141
Avrachenkov K. and Lasserre J.B. (2013) Analytic perturbation of generalized inverses Linear Algebra & Applications 438, pp. 1793--1813
Lasserre J.B. and Tung Phan Thanh (2013) Convex underestimators of polynomials J. Global Optim. 56, pp. 1--25.
Lasserre J.B., Laurent M., Mourrain B., Rostalski P. and P. Trebuchet (2013)  Moment matrices, border bases and real radical computation J. Symbolic Computation 51, pp. 63--85.

2012

Blekherman G. and Lasserre J.B. (2012) The truncated K-moment problem for closure of open sets J. Functional Anal. 263, pp. 3604--3616
Laraki R. and J.B. Lasserre (2012) Semidefinite programming for min-max problems and games Math. Program. S_r. A 131, pp. 305--332
Gravin N., Lasserre J.B., Pasechnik D. and Robins S. (2012) The Inverse Moment Problem for Convex Polytopes Discrete & Comp. Geom. 48, pp. 596--621
Henrion D. and J.B. Lasserre (2012) Inner approximations for polynomial matrix inequalities and robust stability regions IEEE Transactions Aut. Control 57, pp. 1456--1467.
Lasserre J.B. (2012) The existence of Gaussian cubature forrmulas J. Approximation Theory 164, pp. 572--585.
Lasserre J.B. (2012) An algorithm for semi-infinite polynomial optimization TOP 20, pp. 119--129
Lasserre J.B. and Tung Phan Thanh (2012) A ``joint+marginal" heuristic for 0/1 programs J. Global Optim. 54, pp. 729--744

2011

Lasserre J.B. (2011) A new look at nonnegativity on closed sets and polynomial optimization SIAM J. Optim. 21, pp. 864--885.
Lasserre J.B. (2011) On convex optimization without convex representation Optimization Letters 5, pp. 549--556..
Lasserre J.B. (2011) Bounding the support a measure from its marginal moments Proc. Amer. Math. Soc. 139, pp. 3375--3382.
Lasserre J.B. (2011) Min-max and robust polynomial optimization J. Global Optim. 51, pp. 1--10.

2010

Lasserre J.B. and E.S. Zeron (2010) Lp-norms, log-barriers and Cramer transform in optimization Set-Valued and Var. Anal. 18, pp. 513--530.
Lasserre J.B. and M. Putinar (2010) Positivity and optimization for semi-algebraic functions Siam J. Optim. 20, pp. 3364--3383.
Lasserre J.B. (2010) On representations of the feasible set in convex optimization Optim. Letters 4, pp. 1--7.
Lasserre J.B. (2010) Certificates of convexity for basic semi-algebraic sets Applied Math. Letters 23, pp. 912--916.
Lasserre J.B. (2010) A "joint+marginal" approach to parametric polynomial optimization SIAM J. Optim. 20, pp. 1995--2022.

2009

Lasserre J.B. (2009) Convex sets with semidefinite representation Math. Prog. 120, pp. 457--477.
Henrion D., Lasserre J.B., Savorgnan C. (2009) Approximate volume and integration for basic semialgebraic sets SIAM Review 51, pp. 722--743.
Henrion D., Lasserre J.B., Lofberg J. (2009) Gloptipoly 3: moments, optimization and semidefinite programming Optim. Methods and Softwares 24, pp. 761--779.
Lasserre J.B. (2009) The K-moment problem with densities Math. Prog. 116, pp. 321--341.
Lasserre J.B. (2009) Moments and sums of squares for polynomial optimization and related problems J. Global Optim. 45, pp. 39--61.
Lasserre J.B. (2009) Convexity in semialgebraic geometry and polynomial optimization SIAM J. Optim. 19, pp. 1995--2014.
Lasserre J.B., Laurent M, Rostalski P. (2009) A prolongation-projection algorithm for computing the finite real variety of an ideal Theor. Comp. Sci. 410, pp. 2685--2700.

2008

Laraki R., Lasserre J.B. (2008) Computing uniform convex approximations for convex envelopes and convex hulls J. Convex Analysis 15, pp. 635--654.
Bertsimas D., Xuan Vinh Doan, Lasserre J.B. (2008) Approximating integrals of multivariate exponentials: A moment approach Oper. Res. Letters 36, pp. 205--210.
Lasserre J.B., M. Laurent, P. Rostalski (2008) Semidefinite characterization and computation of zero-dimensional real radical ideals Found. Comput. Math. 8, pp. 607--647.
Helton, J.W., Lasserre J.B., Putinar M. (2008) Measures with zeros in the inverse of their moment matrix Annals Prob. 36, pp. 1453--1471.
Lasserre J.B (2008) Representation of nonnegative convex polynomials Arch. der Mathematik 91, pp. 126--130.
Lasserre J.B., Henrion D., Prieur C., Trelat E. (2008) Nonlinear optimal control via occupation measures and LMI-relaxations SIAM J. Contr. Optim. 47, pp. 1649--1666.
Lasserre J.B. (2008) A Semidefinite programming approach to the generalized problem of moments Math. Prog. 112, pp. 65--92.

2007

Lasserre J.B., E.S. Zeron (2007) Simple explicit formula for counting lattice points of polyhedra Lecture Notes in Computer Science 4513, Springer Verlag pp. 367--381.
Lasserre J.B. (2007) A sum of squares approximation of nonnegative polynomials SIAM Review 49, pp. 651--669. (SIGEST section of SIAM Review)
Lasserre J.B. (2007) A new hierarchy of SDP-relaxations for polynomial programming Pacific J. Optim. 3, pp. 273--299.
Lasserre J.B. (2007) Sufficient conditions for a polynomial to be a sum of squares Arch. Math. 89, pp. 390--398.

2006

Lasserre J.B. (2006) Convergent SDP-relaxations in polynomial optimization with sparsity SIAM J. Optim. 17, pp. 822--843.
Lasserre J.B., Prieto-Rumeau T., Zervos M. (2006) Pricing a class of exotic options via moments and SDP relaxations Mathematical Finance 16, pp. 469--494.
Lasserre J.B., Netzer T. (2006) SOS approximations of nonnegative polynomials via simple high degree perturbations Math. Zeitschrift 256, pp. 99--112.
Henrion D., Lasserre J.B. (2006) Convergent relaxations of polynomial matrix inequalities and static output feedback IEEE Trans. Auto. Control 51, pp. 192--202.
Henrion D., Lasserre J.B. (2006) LMIs for constrained polynomial interpolation with application in trajectory planning Systems Contr. Letters 55, pp. 473--477.
Lasserre J.B. (2006) A moment approach to analyze zeros of triangular polynomials sets Trans. Amer. Math. Soc. 358, pp. 1403--1420.
Lasserre J.B. (2006) Robust global optimization with polynomials Math. Programming Ser. B 107, pp. 275--293.
Lasserre J.B. (2006) A sum of squares approximation of nonnegative polynomials SIAM J. Optim. 16, pp. 751--765.

2005

Lasserre J.B. (2005) SOS approximations of polynomials nonnegative on a real algebraic set SIAM J. Optim. 16, pp. 610--628.
Lasserre J.B. (2005) Integer programming duality and superadditive functions Contemporary Mathematics 374, pp. 139--150.
Lasserre J.B., Zeron E.S. (2005) An alternative algorithm for counting lattice points in a convex polytope Math. Oper. Res. 30, pp. 597--614.
Fontan G., Merce C., Hennet J-C., and Lasserre J.B. (2005) Hierarchical scheduling for decision support J. Intelligent Manufacturing 16, pp. 235--244.

2004

Lasserre J.B. (2004) The integer hull of a convex rational polytope Discr. Comp. Geom 32, pp. 129--139.
Lasserre J.B. (2004) Integer Programming Duality in: Trends in Optimization. Proc. Symp. Appl. Math. 61, pp. 67--83.
Lasserre J.B. (2004) Polynomial programming: LP-relaxations also converge SIAM J. Optim. 15, pp. 383--393.
Lasserre J.B. and Prieto-Rumeau T. (2004) SDP vs. LP Relaxations for the Moment Approach in Some Performance Evaluation Problems Stoch. Models 20, pp. 439--456.
Lasserre J.B. (2004) Generating functions and duality for integer programs Discrete Optim. 1, pp. 167--187.
Henrion D., and Lasserre J.B. (2004) Solving nonconvex optimization problems IEEE Control Systems Magazine 24, pp. 72--83.
Lasserre J.B. (2004) Characterizing polynomials with roots in a semialgebraic set IEEE Trans. Aut. Contr. 49, pp. 727--730.
Lasserre J.B. (2004) A discrete Farkas lemma Discrete Optimization 1, pp. 67-75.

2003

Lasserre J.B. and E.S. Zeron (2003) On counting integral points in a convex rational polytope Math. Oper. Res. 28, pp. 853--870.
Henrion D. and J.B. Lasserre (2003) GloptiPoly : Global Optimization over Polynomials with Matlab and SeDuMi ACM Trans. Math. Soft. 29, pp. 165--194.
Lasserre J.B. (2003) Integer programming, Barvinok's counting algorithm and Gomory relaxations Oper. Res. Letters . 32 , pp. 133--137.

2002

Lasserre J.B. (2002) La valeur optimale des programmes entiers C.R. Acad. Sci. Paris, Ser. I 335 , pp. 863--866.
Lasserre J.B. (2002) Polynomials with all zeros real and in a prescribed interval J. Algebraic Combinatorics 16 , pp. 231--237.
Lasserre J.B. and E.S. Zeron (2002) Solving the knapsack problem via Z-transform Oper. Res. Letters 30, pp. 394--400.
Lasserre J.B. (2002) Semidefinite programming vs. LP relaxations for polynomial programming Math. Oper. Res. 27, pp. 347--360.
Lasserre J.B. (2002) Bounds on measures satisfying moment conditions Annals Appl. Prob. 12, pp. 1114-1137.
Lasserre J.B. (2002) An explicit equivalent positive semidefinite program for nonlinear 0-1 programs SIAM J. Optim. 12, pp. 756--769.
Lasserre J.B. (2002) Polynomials nonnegative on a grid and discrete optimization Trans. Amer. Math. Soc. 354, pp. 631--649.
Lasserre J.B. and J-B. Hiriart-Urruty (2002) Mathematical properties of optimization problems defined by positively homogeneous functions J. Optim. Theor. Appl. 112, pp. 31--52.
Dauzère-Péres S. and Lasserre J.B. (2002) On the importance of sequencing decisions in production planning and scheduling Int. Trans. Oper. Res. 9 , pp. 779--793.
Avrachenkov K.E. and J.B. Lasserre (2002) Analytic perturbation of Sylvester matrix equations IEEE Trans. Aut. Contr. 47, pp. 1116--1119.

2001

Lasserre J.B. (2001) A quick proof for the volume of n-balls Amer. Math. Monthly 108, 768--769.
Lasserre J.B. and E.S. Zeron(2001) Solving a class of multivariable integration problems via Laplace Lechniques Appl. Math. (Warsaw) 28, pp. 391--405.
Lasserre J.B. and E.S. Zeron(2001) A Laplace transform algorithm for the volume of a convex polytope Journal of the ACM 48, pp. 1126--1140.
Hernandez-Lerma and J.B. Lasserre (2001) On the probabilistic multichain Poisson equation Appl. Math. (Warsaw) 28, pp. 225--243.
Lasserre J.B. and K.E. Avrachenkov (2001) The multi-dimensional version of $\int_a^b x^p dx$. Amer. Math. Monthly 108, pp. 151--154.
Hernandez-Lerma and J.B. Lasserre (2001) Zero-sum stochastic games in Borel spaces: average payoff criteria SIAM J. Contr. Optim. 39, pp. 1520--1539.
Quadrat J-P., Lasserre J.B. and J.-B. Hiriart-Urruty (2001) Pythagoras' theorem for areas Amer. Math. Monthly 108, pp. 549--551.
Lasserre J.B. (2001) Duality and randomization in nonlinear programming ANZIAM J. 42 (E), pp. E27--E68. (formerly J. Aust. Math. Soc. Series B)
Hernandez-Lerma and J.B. Lasserre (2001) Further criteria for positive Harris recurrence of Markov chains Proc. Amer. Math. Soc. 129, pp. 1521--1524.
Lasserre J.B. and C.E.M. Pearce (2001) On the existence of quasistationary measure for a Markov chain Annals of Probability 29, pp. 437--446.
Lasserre J.B. (2001) Global optimization with polynomials and the problem of moments SIAM J. Optimization 11, pp 796--817.

2000

Lasserre J.B. (2000) Why the Logarithmic Barrier Function in convex and linear programming? Oper. Res. Letters. 27, pp. 149--152.
Filar J. and Lasserre J.B. (2000) A non-standard branch and bound method for the Hamiltonian cycle problem ANZIAM J. 42 (E), pp. C586--C607 (formerly J. Aust. Math. Soc., Series B).
Lasserre J.B. (2000) Optimisation globale et theorie des moments C. R. Acad. Sci. Paris, 331, Serie 1, pp. 929--934.
Hernandez-Lerma O. and Lasserre J.B. (2000) Fatou's and Lebesgue's convergence theorems for measures J. Appl. Math. Stoch. Anal 13, pp. 137--146.
Hernandez-Lerma O. and Lasserre J.B. (2000) On the classification of Markov chains via occupation measures Appl. Math. (Warsaw) 27, pp. 489--498.
Lasserre J.B. (2000) Quasi-Feller Markov chains J. Appl. Math. Stoch. Anal 13, pp. 15--24.