Appeared

2022

2021

2020

2019

2018

2017

2016

2015

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)
 The 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

2010

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.Band 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.Band E.S. Zeron(2001) Solving a class of multivariable integration problems via Laplace Lechniques Appl. Math. (Warsaw) 28, pp. 391--405.
  • Lasserre J.Band 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) 28pp. 225--243.
  • Lasserre J.B.  and K.E. Avrachenkov (2001) The multi-dimensional version of $\int_a^b  x^p dx$.  Amer.  Math.  Monthly 108pp. 151--154.
  • Hernandez-Lerma and J.B. Lasserre (2001) Zero-sum  stochastic games  in Borel spaces: average payoff criteria SIAM J.  Contr.  Optim. 39pp. 1520--1539.
  • Quadrat J-P., Lasserre J.B. and  J.-B. Hiriart-Urruty (2001) Pythagoras' theorem for areas Amer.  Math.  Monthly 108pp. 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.  129pp. 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 11pp 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) 27pp. 489--498.
  • Lasserre J.B(2000) Quasi-Feller Markov chains   J.  Appl.  Math.  Stoch.  Anal 13, pp. 15--24.