Searcharxiv⌕ Search

arXiv subjects

Jean-Bernard Bernard Lasserre

Publications and source records attributed to Jean-Bernard Bernard Lasserre.

2 recordsLinked to original sources

Inverse optimal control with polynomial optimization

In the context of optimal control, we consider the inverse problem of Lagrangian identification given system dynamics and optimal trajectories. Many of its theoretical and practical aspects are still open. Potential applications are very broad as a reliable solution to the problem would provide a powerful modeling tool in many areas of experimental science. We propose to use the Hamilton-Jacobi-Bellman sufficient optimality conditions for the direct problem as a tool for analyzing the inverse problem and propose a general method that attempts at solving it numerically with techniques of polynomial optimization and linear matrix inequalities. The relevance of the method is illustrated based on simulations on academic examples under various settings.

math.OC↗

Mean squared error minimization for inverse moment problems

We consider the problem of approximating the unknown density $u\in L^2(Ω,λ)$ of a measure $μ$ on $Ω\subset\R^n$, absolutely continuous with respect to some given reference measure $λ$, from the only knowledge of finitely many moments of $μ$. Given $d\in\N$ and moments of order $d$, we provide a polynomial $p_d$ which minimizes the mean square error $\int (u-p)^2dλ$ over all polynomials $p$ of degree at most $d$. If there is no additional requirement, $p_d$ is obtained as solution of a linear system. In addition, if $p_d$ is expressed in the basis of polynomials that are orthonormal with respect to $λ$, its vector of coefficients is just the vector of given moments and no computation is needed. Moreover $p_d\to u$ in $L^2(Ω,λ)$ as $d\to\infty$. In general nonnegativity of $p_d$ is not guaranteed even though $u$ is nonnegative. However, with this additional nonnegativity requirement one obtains analogous results but computing $p_d\geq0$ that minimizes $\int (u-p)^2dλ$ now requires solving an appropriate semidefinite program. We have tested the approach on some applications arising from the reconstruction of geometrical objects and the approximation of solutions of nonlinear differential equations. In all cases our results are significantly better than those obtained with the maximum entropy technique for estimating $u$.

math.OC↗