All Stories

  1. Exploiting Constant Trace Property in Large-scale Polynomial Optimization

    Article • ACM Transactions on Mathematical Software, December 2022, ACM (Association for Computing Machinery)

    Dr. Jean B Lasserre

  2. CS-TSSOS: Correlative and Term Sparsity for Large-Scale Polynomial Optimization

    Article • ACM Transactions on Mathematical Software, December 2022, ACM (Association for Computing Machinery)

    Dr. Jean B Lasserre

  3. Modeling crack discontinuities without element-partitioning in the extended finite element method

    Article • International Journal for Numerical Methods in Engineering, November 2017, Wiley

    Dr. Jean B Lasserre

  4. Computing Gaussian & exponential measures of semi-algebraic sets

    Article • Advances in Applied Mathematics, October 2017, Elsevier

    Dr. Jean B Lasserre

  5. Modeling crack discontinuities without element-partitioning in the extended finite element method

    Article • International Journal for Numerical Methods in Engineering, August 2017, Wiley

    Dr. Jean B Lasserre

  6. Bound-Constrained Polynomial Optimization Using Only Elementary Calculations

    Article • Mathematics of Operations Research, March 2017, INFORMS

    Dr. Jean B Lasserre

  7. Exact Solutions to Super Resolution on Semi-Algebraic Domains in Higher Dimensions

    Article • IEEE Transactions on Information Theory, January 2017, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  8. Positivity Certificates in Optimal Control

    Article • January 2017, Springer Science + Business Media

    Dr. Jean B Lasserre

  9. Modeling crack discontinuities without element-partitioning in the extended finite element method

    Article • International Journal for Numerical Methods in Engineering, October 2016, Wiley

    Dr. Jean B Lasserre

  10. Fast and Accurate Computation of Orbital Collision Probability for Short-Term Encounters

    Article • Journal of Guidance Control and Dynamics, May 2016, American Institute of Aeronautics and Astronautics (AIAA)

    Dr. Jean B Lasserre

  11. Lebesgue decomposition in action via semidefinite relaxations

    Article • Advances in Computational Mathematics, March 2016, Springer Science + Business Media

    Dr. Jean B Lasserre

  12. A MAX-CUT formulation of 0/1 programs

    Article • Operations Research Letters, March 2016, Elsevier

    Dr. Jean B Lasserre

  13. Convex Optimization and Parsimony of $L_p$-balls Representation

    Article • SIAM Journal on Optimization, January 2016, Society for Industrial & Applied Mathematics (SIAM)

    Dr. Jean B Lasserre

  14. Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems

    Article • SIAM Journal on Optimization, January 2016, Society for Industrial & Applied Mathematics (SIAM)

    Dr. Jean B Lasserre

  15. Linear Conic Optimization for Inverse Optimal Control

    Article • SIAM Journal on Control and Optimization, January 2016, Society for Industrial & Applied Mathematics (SIAM)

    Dr. Jean B Lasserre

  16. Semidefinite Approximations of the Polynomial Abscissa

    Article • SIAM Journal on Control and Optimization, January 2016, Society for Industrial & Applied Mathematics (SIAM)

    Dr. Jean B Lasserre

  17. Algebraic–exponential Data Recovery from Moments

    Article • Discrete & Computational Geometry, October 2015, Springer Science + Business Media

    Dr. Jean B Lasserre

  18. Numerical integration of homogeneous functions on convex and nonconvex polygons and polyhedra

    Article • Computational Mechanics, October 2015, Springer Science + Business Media

    Dr. Jean B Lasserre

  19. Moments and Legendre-Fourier Series for Measures Supported on Curves

    Article • Symmetry Integrability and Geometry Methods and Applications, September 2015, SIGMA (Symmetry, Integrability and Geometry: Methods and Application)

    Dr. Jean B Lasserre

  20. A bounded degree SOS hierarchy for polynomial optimization

    Article • EURO Journal on Computational Optimization, September 2015, Springer Science + Business Media

    Dr. Jean B Lasserre

  21. Minimizing the sum of many rational functions

    Article • Mathematical Programming Computation, August 2015, Springer Science + Business Media

    Dr. Jean B Lasserre

  22. Volume of slices and sections of the simplex in closed form

    Article • Optimization Letters, May 2015, Springer Science + Business Media

    Dr. Jean B Lasserre

  23. Optimization as motion selection principle in robot action

    Article • Communications of the ACM, April 2015, ACM (Association for Computing Machinery)

    Dr. Jean B Lasserre

  24. The 2013 Newton Institute Programme on polynomial optimization

    Article • Mathematical Programming, March 2015, Springer Science + Business Media

    Dr. Jean B Lasserre

  25. Level Sets and NonGaussian Integrals of Positively Homogeneous Functions

    Article • International Game Theory Review, March 2015, World Scientific Pub Co Pte Lt

    Dr. Jean B Lasserre

  26. An Introduction to Polynomial and Semi-Algebraic Optimization

    Article • January 2015, Cambridge University Press

    Dr. Jean B Lasserre

  27. Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets

    Article • SIAM Journal on Optimization, January 2015, Society for Industrial & Applied Mathematics (SIAM)

    Dr. Jean B Lasserre

  28. Tractable approximations of sets defined with quantifiers

    Article • Mathematical Programming, December 2014, Springer Science + Business Media

    Dr. Jean B Lasserre

  29. Inverse optimal control with polynomial optimization

    Article • December 2014, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  30. Rank-Constrained Fundamental Matrix Estimation by Polynomial Global Optimization Versus the Eight-Point Algorithm

    Article • Journal of Mathematical Imaging and Vision, November 2014, Springer Science + Business Media

    Dr. Jean B Lasserre

  31. A Unified Framework for Solving a General Class of Conditional and Robust Set-Membership Estimation Problems

    Article • IEEE Transactions on Automatic Control, November 2014, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  32. Optimality in robot motion

    Article • Communications of the ACM, September 2014, ACM (Association for Computing Machinery)

    Dr. Jean B Lasserre

  33. Approximating Pareto curves using semidefinite relaxations

    Article • Operations Research Letters, September 2014, Elsevier

    Dr. Jean B Lasserre

  34. A generalization of Löwner-John’s ellipsoid theorem

    Article • Mathematical Programming, August 2014, Springer Science + Business Media

    Dr. Jean B Lasserre

  35. A New Method to Compute the Probability of Collision for Short-term Space Encounters

    Article • August 2014, American Institute of Aeronautics and Astronautics (AIAA)

    Dr. Jean B Lasserre

  36. On Polynomial Optimization Over Non-compact Semi-algebraic Sets

    Article • Journal of Optimization Theory and Applications, July 2014, Springer Science + Business Media

    Dr. Jean B Lasserre

  37. Measures and LMIs for Impulsive Nonlinear Optimal Control

    Article • IEEE Transactions on Automatic Control, May 2014, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  38. Erratum to: On convex optimization without convex representation

    Article • Optimization Letters, April 2014, Springer Science + Business Media

    Dr. Jean B Lasserre

  39. Mean Squared Error Minimization for Inverse Moment Problems

    Article • Applied Mathematics & Optimization, January 2014, Springer Science + Business Media

    Dr. Jean B Lasserre

  40. A Lagrangian relaxation view of linear and semidefinite hierarchies

    Article • December 2013, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  41. A generalization of the Löwner-John's ellipsoid theorem

    Article • December 2013, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  42. Moment LMI approach to LTV impulsive control

    Article • December 2013, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  43. Lower bounds on the global minimum of a polynomial

    Article • Computational Optimization and Applications, September 2013, Springer Science + Business Media

    Dr. Jean B Lasserre

  44. Borel measures with a density on a compact semi-algebraic set

    Article • Archiv der Mathematik, September 2013, Springer Science + Business Media

    Dr. Jean B Lasserre

  45. A Lagrangian Relaxation View of Linear and Semidefinite Hierarchies

    Article • SIAM Journal on Optimization, August 2013, Society for Industrial & Applied Mathematics (SIAM)

    Dr. Jean B Lasserre

  46. Recovering an Homogeneous Polynomial from Moments of Its Level Set

    Article • Discrete & Computational Geometry, August 2013, Springer Science + Business Media

    Dr. Jean B Lasserre

  47. Inverse Polynomial Optimization

    Article • Mathematics of Operations Research, August 2013, INFORMS

    Dr. Jean B Lasserre

  48. Corrigendum to “The truncated K-moment problem for closure of open sets” [J. Funct. Anal. 263 (11) (2012) 3604–3616]

    Article • Journal of Functional Analysis, July 2013, Elsevier

    Dr. Jean B Lasserre

  49. Moment matrices, border bases and real radical computation

    Article • Journal of Symbolic Computation, April 2013, Elsevier

    Dr. Jean B Lasserre

  50. Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization

    Article • Mathematics of Operations Research, February 2013, INFORMS

    Dr. Jean B Lasserre, Cordian Riener

  51. Analytic perturbation of generalized inverses

    Article • Linear Algebra and its Applications, February 2013, Elsevier

    Dr. Jean B Lasserre

  52. New approximations for the cone of copositive matrices and its dual

    Article • Mathematical Programming, January 2013, Springer Science + Business Media

    Dr. Jean B Lasserre

  53. Structured Function Systems and Applications

    Article • Oberwolfach Reports, January 2013, European Mathematical Publishing House

    Dr. Jean B Lasserre

  54. The truncated K-moment problem for closure of open sets

    Article • Journal of Functional Analysis, December 2012, Elsevier

    Dr. Jean B Lasserre

  55. The $\mathbf {K}$-moment problem for continuous linear functionals

    Article • Transactions of the American Mathematical Society, October 2012, American Mathematical Society (AMS)

    Dr. Jean B Lasserre

  56. Convex underestimators of polynomials

    Article • Journal of Global Optimization, September 2012, Springer Science + Business Media

    Dr. Jean B Lasserre

  57. Measures and LMI for impulsive optimal control with applications to space rendezvous problems

    Article • June 2012, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  58. Inner Approximations for Polynomial Matrix Inequalities and Robust Stability Regions

    Article • IEEE Transactions on Automatic Control, June 2012, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  59. The existence of Gaussian cubature formulas

    Article • Journal of Approximation Theory, May 2012, Elsevier

    Dr. Jean B Lasserre

  60. The Inverse Moment Problem for Convex Polytopes

    Article • Discrete & Computational Geometry, May 2012, Springer Science + Business Media

    Dr. Jean B Lasserre

  61. Modern Optimization Modelling Techniques

    Article • January 2012, Springer Science + Business Media

    Dr. Jean B Lasserre, Aris Daniilidis

  62. Chapter 3 Polynomial Optimization

    Article • January 2012, Springer Science + Business Media

    Dr. Jean B Lasserre

  63. Chapter 5 Parametric Polynomial Optimization

    Article • January 2012, Springer Science + Business Media

    Dr. Jean B Lasserre

  64. Chapter 2 Moments

    Article • January 2012, Springer Science + Business Media

    Dr. Jean B Lasserre

  65. Chapter 1 Representation of Positive Polynomials

    Article • January 2012, Springer Science + Business Media

    Dr. Jean B Lasserre

  66. Chapter 4 Convexity in Polynomial Optimization

    Article • January 2012, Springer Science + Business Media

    Dr. Jean B Lasserre

  67. Handbook on Semidefinite, Conic and Polynomial Optimization

    Article • January 2012

    Dr. Jean B Lasserre

  68. Inverse polynomial optimization

    Article • December 2011, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  69. Convex underestimators of polynomials

    Article • December 2011, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  70. A “joint + marginal” heuristic for 0/1 programs

    Article • Journal of Global Optimization, September 2011, Springer Science + Business Media

    Dr. Jean B Lasserre

  71. A “Joint+Marginal” Approach in Optimization

    Article • September 2011, Springer Science + Business Media

    Dr. Jean B Lasserre

  72. Positivity and Optimization: Beyond Polynomials

    Article • September 2011, Springer Science + Business Media

    Dr. Jean B Lasserre

  73. Introduction to Semidefinite, Conic and Polynomial Optimization

    Article • September 2011, Springer Science + Business Media

    Dr. Jean B Lasserre

  74. Bounding the support of a measure from its marginal moments

    Article • Proceedings of the American Mathematical Society, September 2011, American Mathematical Society (AMS)

    Dr. Jean B Lasserre

  75. A New Look at Nonnegativity on Closed Sets and Polynomial Optimization

    Article • SIAM Journal on Optimization, July 2011, Society for Industrial & Applied Mathematics (SIAM)

    Dr. Jean B Lasserre

  76. On convex optimization without convex representation

    Article • Optimization Letters, April 2011, Springer Science + Business Media

    Dr. Jean B Lasserre

  77. An algorithm for semi-infinite polynomial optimization

    Article • Top, February 2011, Springer Science + Business Media

    Dr. Jean B Lasserre

  78. Moment and SDP relaxation techniques for smooth approximations of problems involving nonlinear differential equations

    Article • IFAC Proceedings Volumes, January 2011, Elsevier

    Dr. Jean B Lasserre

  79. Min-max and robust polynomial optimization

    Article • Journal of Global Optimization, December 2010, Springer Science + Business Media

    Dr. Jean B Lasserre

  80. A “joint+marginal” algorithm for polynomial optimization

    Article • December 2010, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  81. L p -Norms, Log-Barriers and Cramer Transform in Optimization

    Article • Set-Valued and Variational Analysis, August 2010, Springer Science + Business Media

    Dr. Jean B Lasserre

  82. Certificates of convexity for basic semi-algebraic sets

    Article • Applied Mathematics Letters, August 2010, Elsevier

    Dr. Jean B Lasserre

  83. Semidefinite programming for min–max problems and games

    Article • Mathematical Programming, May 2010, Springer Science + Business Media

    Dr. Jean B Lasserre

  84. Positivity and Optimization for Semi-Algebraic Functions

    Article • SIAM Journal on Optimization, January 2010, Society for Industrial & Applied Mathematics (SIAM)

    Dr. Jean B Lasserre

  85. A “Joint+Marginal” Approach to Parametric Polynomial Optimization

    Article • SIAM Journal on Optimization, January 2010, Society for Industrial & Applied Mathematics (SIAM)

    Dr. Jean B Lasserre

  86. Discrete-time stochastic optimal control via occupation measures and moment relaxations

    Article • December 2009, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  87. Approximate Volume and Integration for Basic Semialgebraic Sets

    Article • SIAM Review, November 2009, Society for Industrial & Applied Mathematics (SIAM)

    Dr. Jean B Lasserre

  88. On representations of the feasible set in convex optimization

    Article • Optimization Letters, October 2009, Springer Science + Business Media

    Dr. Jean B Lasserre

  89. Moments, Positive Polynomials and Their Applications

    Article • October 2009

    Dr. Jean B Lasserre

  90. GloptiPoly 3: moments, optimization and semidefinite programming

    Article • Optimization Methods and Software, October 2009, Taylor & Francis

    Dr. Jean B Lasserre

  91. A prolongation–projection algorithm for computing the finite real variety of an ideal

    Article • Theoretical Computer Science, June 2009, Elsevier

    Dr. Jean B Lasserre

  92. Moments and sums of squares for polynomial optimization and related problems

    Article • Journal of Global Optimization, January 2009, Springer Science + Business Media

    Dr. Jean B Lasserre

  93. Linear and Integer Programming vs Linear Integration and Counting

    Article • January 2009

    Dr. Jean B Lasserre

  94. Introduction

    Article • January 2009, Springer Science + Business Media

    Dr. Jean B Lasserre

  95. Duality and Gomory Relaxations

    Article • January 2009, Springer Science + Business Media

    Dr. Jean B Lasserre

  96. A Discrete Farkas Lemma

    Article • January 2009, Springer Science + Business Media

    Dr. Jean B Lasserre

  97. Duality and Superadditive Functions

    Article • January 2009, Springer Science + Business Media

    Dr. Jean B Lasserre

  98. Duality and a Farkas lemma for integer programs

    Article • January 2009, Springer Science + Business Media

    Dr. Jean B Lasserre

  99. Convexity in SemiAlgebraic Geometry and Polynomial Optimization

    Article • SIAM Journal on Optimization, January 2009, Society for Industrial & Applied Mathematics (SIAM)

    Dr. Jean B Lasserre

  100. The Linear Integration Problem I

    Article • January 2009, Springer Science + Business Media

    Dr. Jean B Lasserre

  101. Comparing the Continuous Problems P and I

    Article • January 2009, Springer Science + Business Media

    Dr. Jean B Lasserre

  102. The Linear Counting Problem Id

    Article • January 2009, Springer Science + Business Media

    Dr. Jean B Lasserre

  103. Relating the Discrete Problems Pd and Id with P

    Article • January 2009, Springer Science + Business Media

    Dr. Jean B Lasserre

  104. Barvinok’s Counting Algorithm and Gomory Relaxations

    Article • January 2009, Springer Science + Business Media

    Dr. Jean B Lasserre

  105. The Integer Hull of a Convex Rational Polytope

    Article • January 2009, Springer Science + Business Media

    Dr. Jean B Lasserre

  106. A Unified Approach to Computing Real and Complex Zeros of Zero-Dimensional Ideals

    Article • September 2008, Springer Science + Business Media

    Dr. Jean B Lasserre

  107. Representation of nonnegative convex polynomials

    Article • Archiv der Mathematik, August 2008, Springer Science + Business Media

    Dr. Jean B Lasserre

  108. Measures with zeros in the inverse of their moment matrix

    Article • The Annals of Probability, July 2008, Institute of Mathematical Statistics

    Dr. Jean B Lasserre

  109. Convex sets with semidefinite representation

    Article • Mathematical Programming, May 2008, Springer Science + Business Media

    Dr. Jean B Lasserre

  110. Approximating integrals of multivariate exponentials: A moment approach

    Article • Operations Research Letters, March 2008, Elsevier

    Dr. Jean B Lasserre

  111. Nonlinear optimal control synthesis via occupation measures

    Article • January 2008, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  112. Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations

    Article • SIAM Journal on Control and Optimization, January 2008, Society for Industrial & Applied Mathematics (SIAM)

    Dr. Jean B Lasserre

  113. Computing the real variety of an ideal

    Article • January 2008, ACM (Association for Computing Machinery)

    Dr. Jean B Lasserre

  114. Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals

    Article • Foundations of Computational Mathematics, October 2007, Springer Science + Business Media

    Dr. Jean B Lasserre

  115. Sufficient conditions for a real polynomial to be a sum of squares

    Article • Archiv der Mathematik, September 2007, Springer Science + Business Media

    Dr. Jean B Lasserre

  116. The K-moment problem with densities

    Article • Mathematical Programming, May 2007, Springer Science + Business Media

    Dr. Jean B Lasserre

  117. A semidefinite programming approach to the generalized problem of moments

    Article • Mathematical Programming, February 2007, Springer Science + Business Media

    Dr. Jean B Lasserre

  118. A Sum of Squares Approximation of Nonnegative Polynomials

    Article • SIAM Review, January 2007, Society for Industrial & Applied Mathematics (SIAM)

    Dr. Jean B Lasserre

  119. Semidefinite programming for gradient and Hessian computation in maximum entropy estimation

    Article • January 2007, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  120. SOS approximations of nonnegative polynomials via simple high degree perturbations

    Article • Mathematische Zeitschrift, November 2006, Springer Science + Business Media

    Dr. Jean B Lasserre

  121. PRICING A CLASS OF EXOTIC OPTIONS VIA MOMENTS AND SDP RELAXATIONS

    Article • Mathematical Finance, July 2006, Wiley

    Dr. Jean B Lasserre

  122. LMIs for constrained polynomial interpolation with application in trajectory planning

    Article • Systems & Control Letters, June 2006, Elsevier

    Dr. Jean B Lasserre

  123. Article • Transactions of the American Mathematical Society, April 2006, American Mathematical Society (AMS)

    Dr. Jean B Lasserre

  124. Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback

    Article • IEEE Transactions on Automatic Control, February 2006, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  125. Convergent SDP-Relaxations for Polynomial Optimization with Sparsity

    Article • January 2006, Springer Science + Business Media

    Dr. Jean B Lasserre

  126. Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity

    Article • SIAM Journal on Optimization, January 2006, Society for Industrial & Applied Mathematics (SIAM)

    Dr. Jean B Lasserre

  127. A Sum of Squares Approximation of Nonnegative Polynomials

    Article • SIAM Journal on Optimization, January 2006, Society for Industrial & Applied Mathematics (SIAM)

    Dr. Jean B Lasserre

  128. Robust global optimization with polynomials

    Article • Mathematical Programming, December 2005, Springer Science + Business Media

    Dr. Jean B Lasserre

  129. A Moment Approach to Analyze Zeros of Triangular Polynomial Sets

    Article • August 2005, Springer Science + Business Media

    Dr. Jean B Lasserre

  130. Detecting Global Optimality and Extracting Solutions in GloptiPoly

    Article • August 2005, Springer Science + Business Media

    Dr. Jean B Lasserre

  131. An Alternative Algorithm for Counting Lattice Points in a Convex Polytope

    Article • Mathematics of Operations Research, August 2005, INFORMS

    Dr. Jean B Lasserre

  132. Hierarchical scheduling for decision support

    Article • Journal of Intelligent Manufacturing, April 2005, Springer Science + Business Media

    Dr. Jean B Lasserre

  133. Erratum to “Generating functions and duality for integer programs”

    Article • Discrete Optimization, March 2005, Elsevier

    Dr. Jean B Lasserre

  134. Polynomial Programming: LP-Relaxations Also Converge

    Article • SIAM Journal on Optimization, January 2005, Society for Industrial & Applied Mathematics (SIAM)

    Dr. Jean B Lasserre

  135. Integer programming, duality and superadditive functions

    Article • January 2005, American Mathematical Society (AMS)

    Dr. Jean B Lasserre

  136. Sum of Squares Approximation of Polynomials, Nonnegative on a Real Algebraic Set

    Article • SIAM Journal on Optimization, January 2005, Society for Industrial & Applied Mathematics (SIAM)

    Dr. Jean B Lasserre

  137. SDP vs. LP Relaxations for the Moment Approach in Some Performance Evaluation Problems

    Article • Stochastic Models, December 2004, Taylor & Francis

    Dr. Jean B Lasserre

  138. Generating functions and duality for integer programs

    Article • Discrete Optimization, November 2004, Elsevier

    Dr. Jean B Lasserre

  139. A discrete Farkas lemma

    Article • Discrete Optimization, June 2004, Elsevier

    Dr. Jean B Lasserre

  140. Feature - How gloptipoly is applied to problems in robust and nonlinear control Solving nonconvex optimization problems

    Article • IEEE Control Systems, June 2004, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  141. The Integer Hull of a Convex Rational Polytope

    Article • Discrete & Computational Geometry, May 2004, Springer Science + Business Media

    Dr. Jean B Lasserre

  142. Characterizing Polynomials With Roots in a Semialgebraic Set

    Article • IEEE Transactions on Automatic Control, May 2004, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  143. Integer programming, Barvinok's counting algorithm and Gomory relaxations

    Article • Operations Research Letters, March 2004, Elsevier

    Dr. Jean B Lasserre

  144. Correction

    Article • The Annals of Applied Probability, January 2004, Institute of Mathematical Statistics

    Dr. Jean B Lasserre

  145. Integer programming duality

    Article • January 2004, American Mathematical Society (AMS)

    Dr. Jean B Lasserre

  146. On Counting Integral Points in a Convex Rational Polytope

    Article • Mathematics of Operations Research, November 2003, INFORMS

    Dr. Jean B Lasserre

  147. GloptiPoly

    Article • ACM Transactions on Mathematical Software, June 2003, ACM (Association for Computing Machinery)

    Dr. Jean B Lasserre

  148. Markov Chains and Invariant Probabilities

    Article • January 2003, Springer Science + Business Media

    Dr. Jean B Lasserre

  149. Preliminaries

    Article • January 2003, Springer Science + Business Media

    Dr. Jean B Lasserre

  150. Feller Markov Chains

    Article • January 2003, Springer Science + Business Media

    Dr. Jean B Lasserre

  151. Strong and Uniform Ergodicity

    Article • January 2003, Springer Science + Business Media

    Dr. Jean B Lasserre

  152. Markov Chains and Ergodic Theorems

    Article • January 2003, Springer Science + Business Media

    Dr. Jean B Lasserre

  153. Countable Markov Chains

    Article • January 2003, Springer Science + Business Media

    Dr. Jean B Lasserre

  154. Harris Markov Chains

    Article • January 2003, Springer Science + Business Media

    Dr. Jean B Lasserre

  155. The Poisson Equation

    Article • January 2003, Springer Science + Business Media

    Dr. Jean B Lasserre

  156. Markov Chains in Metric Spaces

    Article • January 2003, Springer Science + Business Media

    Dr. Jean B Lasserre

  157. Existence and Uniqueness of Fixed Points for Markov Operators

    Article • January 2003, Springer Science + Business Media

    Dr. Jean B Lasserre

  158. Existence and Uniqueness of Invariant Probability Measures

    Article • January 2003, Springer Science + Business Media

    Dr. Jean B Lasserre

  159. Classification of Markov Chains via Occupation Measures

    Article • January 2003, Springer Science + Business Media

    Dr. Jean B Lasserre

  160. Approximation Procedures for Invariant Probability Measures

    Article • January 2003, Springer Science + Business Media

    Dr. Jean B Lasserre

  161. Solving Global Optimization Problems over Polynomials with GloptiPoly 2.1

    Article • January 2003, Springer Science + Business Media

    Dr. Jean B Lasserre

  162. The Integer Hull of a Convex Rational Polytope

    Article • January 2003, Springer Science + Business Media

    Dr. Jean B Lasserre

  163. A Discrete Farkas Lemma

    Article • January 2003, Springer Science + Business Media

    Dr. Jean B Lasserre

  164. Solving the knapsack problem via -transform

    Article • Operations Research Letters, December 2002, Elsevier

    Dr. Jean B Lasserre

  165. La valeur optimale des programmes entiers

    Article • Comptes Rendus Mathématique, December 2002, Elsevier

    Dr. Jean B Lasserre

  166. On the importance of sequencing decisions in production planning and scheduling

    Article • International Transactions in Operational Research, November 2002, Wiley

    Dr. Jean B Lasserre

  167. Bounds on measures satisfying moment conditions

    Article • August 2002, Institute of Mathematical Statistics

    Dr. Jean B Lasserre

  168. Analytic perturbation of Sylvester matrix equations

    Article • IEEE Transactions on Automatic Control, July 2002, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  169. Semidefinite Programming vs. LP Relaxations for Polynomial Programming

    Article • Mathematics of Operations Research, May 2002, INFORMS

    Dr. Jean B Lasserre

  170. Article • Transactions of the American Mathematical Society, February 2002, American Mathematical Society (AMS)

    Dr. Jean B Lasserre

  171. The Linear Programming Approach

    Article • January 2002, Springer Science + Business Media

    Dr. Jean B Lasserre

  172. An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs

    Article • SIAM Journal on Optimization, January 2002, Society for Industrial & Applied Mathematics (SIAM)

    Dr. Jean B Lasserre

  173. Mathematical Properties of Optimization Problems Defined by Positively Homogeneous Functions

    Article • Journal of Optimization Theory and Applications, January 2002, Springer Science + Business Media

    Dr. Jean B Lasserre

  174. Article • Journal of Algebraic Combinatorics, January 2002, Springer Science + Business Media

    Dr. Jean B Lasserre

  175. A Laplace transform algorithm for the volume of a convex polytope

    Article • Journal of the ACM, November 2001, ACM (Association for Computing Machinery)

    Dr. Jean B Lasserre

  176. A Quick Proof for the Volume of n-Balls

    Article • American Mathematical Monthly, October 2001, JSTOR

    Dr. Jean B Lasserre

  177. Pythagoras' Theorem for Areas

    Article • American Mathematical Monthly, June 2001, JSTOR

    Dr. Jean B Lasserre

  178. chain

    Article • The Annals of Probability, February 2001, Institute of Mathematical Statistics

    Dr. Jean B Lasserre

  179. The Multi-Dimensional Version of � b a x p dx

    Article • American Mathematical Monthly, February 2001, JSTOR

    Dr. Jean B Lasserre

  180. On the probabilistic multichain Poisson equation

    Article • Applicationes Mathematicae, January 2001, Institute of Mathematics, Polish Academy of Sciences

    Dr. Jean B Lasserre

  181. Solving a class of multivariate integration problems via Laplace techniques

    Article • Applicationes Mathematicae, January 2001, Institute of Mathematics, Polish Academy of Sciences

    Dr. Jean B Lasserre

  182. New Positive Semidefinite Relaxations for Nonconvex Quadratic Programs

    Article • January 2001, Springer Science + Business Media

    Dr. Jean B Lasserre

  183. An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs

    Article • January 2001, Springer Science + Business Media

    Dr. Jean B Lasserre

  184. Global Optimization with Polynomials and the Problem of Moments

    Article • SIAM Journal on Optimization, January 2001, Society for Industrial & Applied Mathematics (SIAM)

    Dr. Jean B Lasserre

  185. Optimisation globale et théorie des moments

    Article • Comptes Rendus de l Académie des Sciences - Series I - Mathematics, December 2000, Elsevier

    Dr. Jean B Lasserre

  186. Why the logarithmic barrier function in convex and linear programming?

    Article • Operations Research Letters, November 2000, Elsevier

    Dr. Jean B Lasserre

  187. Quasi-Feller Markov chains

    Article • Journal of Applied Mathematics and Stochastic Analysis, January 2000, Hindawi Publishing Corporation

    Dr. Jean B Lasserre

  188. Zero-Sum Stochastic Games in Borel Spaces: Average Payoff Criteria

    Article • SIAM Journal on Control and Optimization, January 2000, Society for Industrial & Applied Mathematics (SIAM)

    Dr. Jean B Lasserre

  189. Fatou's Lemma and Lebesgue's convergence theorem for measures

    Article • Journal of Applied Mathematics and Stochastic Analysis, January 2000, Hindawi Publishing Corporation

    Dr. Jean B Lasserre

  190. The fundamental matrix of singularly perturbed Markov chains

    Article • September 1999, Cambridge University Press

    Dr. Jean B Lasserre

  191. The fundamental matrix of singularly perturbed Markov chains

    Article • Advances in Applied Probability, September 1999, Cambridge University Press

    Dr. Jean B Lasserre

  192. Further Topics on Discrete-Time Markov Control Processes

    Article • January 1999, Springer Science + Business Media

    Dr. Jean B Lasserre

  193. The Linear Programming Approach

    Article • January 1999, Springer Science + Business Media

    Dr. Jean B Lasserre

  194. Discounted Dynamic Programming with Weighted Norms

    Article • January 1999, Springer Science + Business Media

    Dr. Jean B Lasserre

  195. Undiscounted Cost Criteria

    Article • January 1999, Springer Science + Business Media

    Dr. Jean B Lasserre

  196. The Expected Total Cost Criterion

    Article • January 1999, Springer Science + Business Media

    Dr. Jean B Lasserre

  197. Sample Path Average Cost

    Article • January 1999, Springer Science + Business Media

    Dr. Jean B Lasserre

  198. Ergodicity and Poisson’s Equation

    Article • January 1999, Springer Science + Business Media

    Dr. Jean B Lasserre

  199. Planning and scheduling in a multi-site environment

    Article • Production Planning & Control, January 1999, Taylor & Francis

    Dr. Jean B Lasserre

  200. Sample-path average optimality for Markov control processes

    Article • IEEE Transactions on Automatic Control, January 1999, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  201. Approximation Schemes for Infinite Linear Programs

    Article • SIAM Journal on Optimization, November 1998, Society for Industrial & Applied Mathematics (SIAM)

    Dr. Jean B Lasserre

  202. A Lyapunov Criterion for Invariant Probabilities with Geometric Tail

    Article • Probability in the Engineering and Informational Sciences, July 1998, Cambridge University Press

    Dr. Jean B Lasserre

  203. Multi-resource shop scheduling with resource flexibility

    Article • European Journal of Operational Research, June 1998, Elsevier

    Dr. Jean B Lasserre

  204. Existence and Uniqueness of Fixed Points for Markov Operators and Markov Processes

    Article • Test´s Publication, May 1998, Oxford University Press (OUP)

    Dr. Jean B Lasserre

  205. Lot Streaming in Job-Shop Scheduling

    Article • Operations Research, August 1997, INFORMS

    Dr. Jean B Lasserre

  206. Invariant probabilities for Markov chains on a metric space

    Article • Statistics & Probability Letters, June 1997, Elsevier

    Dr. Jean B Lasserre

  207. Tight bounds for the trace of a matrix product

    Article • IEEE Transactions on Automatic Control, April 1997, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  208. A Farkas lemma Without A Standard Closure Condition

    Article • SIAM Journal on Control and Optimization, January 1997, Society for Industrial & Applied Mathematics (SIAM)

    Dr. Jean B Lasserre

  209. On the setwise convergence of sequences of measures

    Article • Journal of Applied Mathematics and Stochastic Analysis, January 1997, Hindawi Publishing Corporation

    Dr. Jean B Lasserre

  210. Discrete-Time Markov Control Processes: Basic Optimality Criteria.

    Article • Journal of the American Statistical Association, December 1996, JSTOR

    Dr. Jean B Lasserre

  211. Existence of bounded invariant probability densities for Markov chains

    Article • Statistics & Probability Letters, August 1996, Elsevier

    Dr. Jean B Lasserre

  212. Existence and uniqueness of an invariant probability for a class of Feller Markov chains

    Article • Journal of Theoretical Probability, July 1996, Springer Science + Business Media

    Dr. Jean B Lasserre

  213. Invariant Probabilities with Geometric Tail

    Article • Probability in the Engineering and Informational Sciences, April 1996, Cambridge University Press

    Dr. Jean B Lasserre

  214. Discrete-Time Markov Control Processes

    Article • January 1996, Springer Science + Business Media

    Dr. Jean B Lasserre

  215. Infinite-Horizon Discounted-Cost Problems

    Article • January 1996, Springer Science + Business Media

    Dr. Jean B Lasserre

  216. The Linear Programming Formulation

    Article • January 1996, Springer Science + Business Media

    Dr. Jean B Lasserre

  217. Long-Run Average-Cost Problems

    Article • January 1996, Springer Science + Business Media

    Dr. Jean B Lasserre

  218. Introduction and Summary

    Article • January 1996, Springer Science + Business Media

    Dr. Jean B Lasserre

  219. Markov Control Processes

    Article • January 1996, Springer Science + Business Media

    Dr. Jean B Lasserre

  220. Finite-Horizon Problems

    Article • January 1996, Springer Science + Business Media

    Dr. Jean B Lasserre

  221. Average Optimality in Markov Control Processes via Discounted-Cost Problems and Linear Programming

    Article • SIAM Journal on Control and Optimization, January 1996, Society for Industrial & Applied Mathematics (SIAM)

    Dr. Jean B Lasserre

  222. Linear programming with positive semi-definite matrices

    Article • Mathematical Problems in Engineering, January 1996, Hindawi Publishing Corporation

    Dr. Jean B Lasserre

  223. A new Farkas lemma for positive semidefinite matrices

    Article • IEEE Transactions on Automatic Control, June 1995, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  224. Invariant probabilities for Feller-Markov chains

    Article • Journal of Applied Mathematics and Stochastic Analysis, January 1995, Hindawi Publishing Corporation

    Dr. Jean B Lasserre

  225. A trace inequality for matrix product

    Article • IEEE Transactions on Automatic Control, January 1995, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  226. Detecting Optimal and Non-Optimal Actions in Average-Cost Markov Decision Processes

    Article • Journal of Applied Probability, December 1994, Cambridge University Press

    Dr. Jean B Lasserre

  227. A Formula for Singular Perturbations of Markov Chains

    Article • Journal of Applied Probability, September 1994, Cambridge University Press

    Dr. Jean B Lasserre

  228. Integration of lotsizing and scheduling decisions in a job-shop

    Article • European Journal of Operational Research, June 1994, Elsevier

    Dr. Jean B Lasserre

  229. Weak conditions for average optimality in Markov control processes

    Article • Systems & Control Letters, April 1994, Elsevier

    Dr. Jean B Lasserre

  230. Average Optimal Stationary Policies and Linear Programming in Countable Space Markov Decision Processes

    Article • Journal of Mathematical Analysis and Applications, April 1994, Elsevier

    Dr. Jean B Lasserre

  231. Linear Programming and Average Optimality of Markov Control Processes on Borel Spaces—Unbounded Costs

    Article • SIAM Journal on Control and Optimization, March 1994, Society for Industrial & Applied Mathematics (SIAM)

    Dr. Jean B Lasserre

  232. Linear programming formulation of MDPs in countable state space: The multichain case

    Article • Mathematical Methods of Operations Research, March 1994, Springer Science + Business Media

    Dr. Jean B Lasserre

  233. An Integrated Approach in Production Planning and Scheduling

    Article • January 1994

    Dr. Jean B Lasserre

  234. Various Resolution Strategies

    Article • January 1994, Springer Science + Business Media

    Dr. Jean B Lasserre

  235. Lot Streaming

    Article • January 1994, Springer Science + Business Media

    Dr. Jean B Lasserre

  236. Job-Shop Sequencing and Scheduling

    Article • January 1994, Springer Science + Business Media

    Dr. Jean B Lasserre

  237. Extensions of the Model

    Article • January 1994, Springer Science + Business Media

    Dr. Jean B Lasserre

  238. An Integrated Planning and Scheduling Model

    Article • January 1994, Springer Science + Business Media

    Dr. Jean B Lasserre

  239. Production Planning and Scheduling

    Article • January 1994, Springer Science + Business Media

    Dr. Jean B Lasserre

  240. An iterative procedure for lot streaming in job-shop scheduling

    Article • Computers & Industrial Engineering, September 1993, Elsevier

    Dr. Jean B Lasserre

  241. Value Iteration and Rolling Plans for Markov Control Processes with Unbounded Rewards

    Article • Journal of Mathematical Analysis and Applications, July 1993, Elsevier

    Dr. Jean B Lasserre

  242. A modified shifting bottleneck procedure for job-shop scheduling

    Article • International Journal of Production Research, April 1993, Taylor & Francis

    Dr. Jean B Lasserre

  243. Reachable, controllable sets and stabilizing control of constrained linear systems

    Article • Automatica, March 1993, Elsevier

    Dr. Jean B Lasserre

  244. Preface

    Article • Annals of Operations Research, December 1991, Springer Science + Business Media

    Dr. Jean B Lasserre

  245. Exact formula for sensitivity analysis of Markov chains

    Article • Journal of Optimization Theory and Applications, November 1991, Springer Science + Business Media

    Dr. Jean B Lasserre

  246. Reachable and controllable sets for two-dimensional, linear, discrete-time systems

    Article • Journal of Optimization Theory and Applications, September 1991, Springer Science + Business Media

    Dr. Jean B Lasserre

  247. Average cost Markov Decision Processes: Optimality conditions

    Article • Journal of Mathematical Analysis and Applications, July 1991, Elsevier

    Dr. Jean B Lasserre

  248. Robust hierarchical production planning under uncertainty

    Article • Annals of Operations Research, December 1990, Springer Science + Business Media

    Dr. Jean B Lasserre

  249. Average cost optimal policies for Markov control processes with Borel state space and unbounded costs

    Article • Systems & Control Letters, November 1990, Elsevier

    Dr. Jean B Lasserre

  250. Denumerable state nonhomogeneous Markov decision processes

    Article • Journal of Mathematical Analysis and Applications, November 1990, Elsevier

    Dr. Jean B Lasserre

  251. Error bounds for rolling horizon policies in discrete-time Markov control processes

    Article • IEEE Transactions on Automatic Control, January 1990, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  252. Conditions for existence of average and Blackwell optimal stationary policies in denumerable Markov decision processes

    Article • Journal of Mathematical Analysis and Applications, December 1988, Elsevier

    Dr. Jean B Lasserre

  253. Existence of closed-loop policies for constrained discrete-time linear systems with bounded disturbances

    Article • Journal of Optimization Theory and Applications, August 1988, Springer Science + Business Media

    Dr. Jean B Lasserre

  254. Strong 1-optimal stationary policies in denumerable Markov decision processes

    Article • Systems & Control Letters, July 1988, Elsevier

    Dr. Jean B Lasserre

  255. A forecast horizon and a stopping rule for general Markov decision processes

    Article • Journal of Mathematical Analysis and Applications, June 1988, Elsevier

    Dr. Jean B Lasserre

  256. A complete characterization of reachable sets for constrained linear time-varying systems

    Article • IEEE Transactions on Automatic Control, September 1987, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  257. Consistency of a linear system of inequalities

    Article • Journal of Optimization Theory and Applications, April 1987, Springer Science + Business Media

    Dr. Jean B Lasserre

  258. Simulated annealing, random search, multistart or SAD?

    Article • Systems & Control Letters, March 1987, Elsevier

    Dr. Jean B Lasserre

  259. An on-line procedure in discounted infinite-horizon stochastic optimal control

    Article • Journal of Optimization Theory and Applications, July 1986, Springer Science + Business Media

    Dr. Jean B Lasserre

  260. Consistency of a linear system of inequalities

    Article • Journal of Optimization Theory and Applications, April 1986, Springer Science + Business Media

    Dr. Jean B Lasserre

  261. Detecting planning horizons in deterministic infinite horizon optimal control

    Article • IEEE Transactions on Automatic Control, January 1986, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  262. Measuring decision flexibility in production planning

    Article • IEEE Transactions on Automatic Control, May 1985, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  263. A mixed forward-backward dynamic programming method using parallel computation

    Article • Journal of Optimization Theory and Applications, January 1985, Springer Science + Business Media

    Dr. Jean B Lasserre

  264. Infinite horizon nonstationary stochastic optimal control problem: A planning horizon result

    Article • IEEE Transactions on Automatic Control, September 1984, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  265. On the open-loop solution of linear stochastic optimal control problems

    Article • IEEE Transactions on Automatic Control, June 1984, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  266. Aggregate model and decomposition method for mid-term production planning

    Article • International Journal of Production Research, November 1983, Taylor & Francis

    Dr. Jean B Lasserre

  267. An analytical expression and an algorithm for the volume of a convex polyhedron inR n

    Article • Journal of Optimization Theory and Applications, March 1983, Springer Science + Business Media

    Dr. Jean B Lasserre

  268. A globally convergent algorithm for exact penalty functions

    Article • European Journal of Operational Research, August 1981, Elsevier

    Dr. Jean B Lasserre

  269. A property of certain multistage linear programs and some applications

    Article • Journal of Optimization Theory and Applications, June 1981, Springer Science + Business Media

    Dr. Jean B Lasserre

  270. Preface

    Article • Cambridge University Press

    Dr. Jean B Lasserre

  271. Global optimality certificates

    Article • Cambridge University Press

    Dr. Jean B Lasserre

  272. Parametric optimization

    Article • Cambridge University Press

    Dr. Jean B Lasserre

  273. Inverse polynomial optimization

    Article • Cambridge University Press

    Dr. Jean B Lasserre

  274. Semidefinite programming

    Article • Cambridge University Press

    Dr. Jean B Lasserre

  275. The GloptiPoly software

    Article • Cambridge University Press

    Dr. Jean B Lasserre

  276. References

    Article • Cambridge University Press

    Dr. Jean B Lasserre

  277. Introduction and message of the book

    Article • Cambridge University Press

    Dr. Jean B Lasserre

  278. Positive polynomials and moment problems

    Article • Cambridge University Press

    Dr. Jean B Lasserre

  279. Another look at nonnegativity

    Article • Cambridge University Press

    Dr. Jean B Lasserre

  280. The cone of polynomials nonnegative on K

    Article • Cambridge University Press

    Dr. Jean B Lasserre

  281. The primal and dual points of view

    Article • Cambridge University Press

    Dr. Jean B Lasserre

  282. Semidefinite relaxations for polynomial optimization

    Article • Cambridge University Press

    Dr. Jean B Lasserre

  283. Exploiting sparsity or symmetry

    Article • Cambridge University Press

    Dr. Jean B Lasserre

  284. Minimization of rational functions

    Article • Cambridge University Press

    Dr. Jean B Lasserre

  285. LP-relaxations for polynomial optimization

    Article • Cambridge University Press

    Dr. Jean B Lasserre

  286. Semidefinite relaxations for semi-algebraic optimization

    Article • Cambridge University Press

    Dr. Jean B Lasserre

  287. Polynomial optimization as an eigenvalue problem

    Article • Cambridge University Press

    Dr. Jean B Lasserre

  288. Convexity in polynomial optimization

    Article • Cambridge University Press

    Dr. Jean B Lasserre

  289. Convex underestimators of polynomials

    Article • Cambridge University Press

    Dr. Jean B Lasserre

  290. Approximation of sets defined with quantifiers

    Article • Cambridge University Press

    Dr. Jean B Lasserre

  291. Simple Explicit Formula for Counting Lattice Points of Polyhedra

    Article • Springer Science + Business Media

    Dr. Jean B Lasserre

  292. Level sets and a generalization of the Löwner–John problem

    Article • Cambridge University Press

    Dr. Jean B Lasserre

  293. Nonlinear optimal control: approximations via moments and LMI-relaxations

    Article • Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  294. SOS approximation of polynomials nonnegative on an algebraic set

    Article • Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre

  295. Analytic perturbation of Sylvester and Lyapunov matrix equations

    Article • Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Jean B Lasserre