The generalized problem of moments is a conic linear optimization problem over the convex cone of positive Borel measures with given support. It has a large variety of applications, including global optimization of polynomials and rational functions, option pricing in finance, constructing quadrature schemes for numerical integration, and distributionally robust optimization. A usual solution approach, due to J.B. Lasserre, is to approximate the convex cone of positive Borel measures by finite dimensional outer and inner conic approximations. We will review some results on these approximations, with a special focus on the convergence rate of the hierarchies of upper and lower bounds for the general problem of moments that are obtained from these inner and outer approximations.
Association for Women in Mathematics Series
Networks and Optimization

de Klerk, E, & Laurent, M. (2019). A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis. In World Women in Mathematics 2018 (pp. 17–56). doi:10.1007/978-3-030-21170-7_1