Jean-Bernard Lasserre Given a compact parameter set $Y\subset R^p$, we consider polynomial optimization problems $(P_\y$) on $R^n$ whose description depends on the parameter $y\in Y$. We assume that one can compute all moments of some probability measure $\varphi$ on $Y$, absolutely continuous with respect to the Lebesgue measure (e.g. $Y$ is a box or a simplex and … Read more
We provide a specific representation of convex polynomials nonnegative on a convex (not necessarily compact) basic closed semi-algebraic set $K$ of $R^n$. Namely, they belong to a specific subset of the quadratic module generated by the concave polynomials that define $K$. CitationTo appear in Archiv der MathematikArticleDownload View PDF
We review several (and provide new) results on the theory of moments, sums of squares and basic semi-algebraic sets when convexity is present. In particular, we show that under convexity, the hierarchy of semidefinite relaxations for polynomial optimization simplifies and has finite convergence, a highly desirable feature as convex problems are in principle easier to … Read more
We describe a major update of our Matlab freeware GloptiPoly for parsing generalized problems of moments and solving them numerically with semidefinite programming. Citation28 June 2007ArticleDownload View PDF
We consider the classical problem of estimating a density on $[0,1]$ via some maximum entropy criterion. For solving this convex optimization problem with algorithms using first-order or second-order methods, at each iteration one has to compute (or at least approximate) moments of some measure with a density on $[0,1]$, to obtain gradient and Hessian data. … Read more
We propose a method to approximate a class of exponential multivariate integrals using moment relaxations. Using this approach, both lower and upper bounds of the integrals are obtained and we show that these bound values asymptotically converge to the real value of the integrals when the moment degree r increases. We further demonstrate the method … Read more
We propose a moment relaxation for two problems, the separation and covering problem with semi-algebraic sets generated by a polynomial of degree d. We show that (a) the optimal value of the relaxation finitely converges to the optimal value of the original problem, when the moment order r increases and (b) there exist probability measures … Read more
We provide explicit sufficient conditions for a polynomial $f$ to be a sum of squares (s.o.s.), linear in the coefficients of $f$. All conditions are simple and provide an explicit description of a convex polyhedral subcone of the cone of s.o.s. polynomials of degree at most $2d$. We also provide a simple condition to ensure … Read more
We investigate and discuss when the inverse of a multivariate truncated moment matrix of a measure has zeros in some prescribed entries. We describe precisely which pattern of these zeroes corresponds to independence, namely, the measure having a product structure. A more refined finding is that the key factor forcing a zero entry in this … Read more
Given $z\in C^n$ and $A\in Z^{m\times n}$, we consider the problem of evaluating the counting function $h(y;z):=\sum\{z^x : x \in Z^n; Ax = y, x \geq 0\}$. We provide an explicit expression for $h(y;z)$ as well as an algorithm with possibly numerous but simple computations. In addition, we exhibit finitely many fixed convex cones of … Read more