2020-01-21
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere
Publication
Publication
Mathematical Programming , Volume 193 p. 665- 685
We study the convergence rate of a hierarchy of upper bounds for polynomial minimization problems, proposed by Lasserre (SIAM J Optim 21(3):864–885, 2011), for the special case when the feasible set is the unit (hyper)sphere. The upper bound at level r∈N of the hierarchy is defined as the minimal expected value of the polynomial over all probability distributions on the sphere, when the probability density function is a sum-of-squares polynomial of degree at most 2r with respect to the surface measure. We show that the rate of convergence is O(1/r2) and we give a class of polynomials of any positive degree for which this rate is tight. In addition, we explore the implications for the related rate of convergence for the generalized problem of moments on the sphere.
| Additional Metadata | |
|---|---|
| , , , | |
| doi.org/10.1007/s10107-019-01465-1 | |
| Mathematical Programming | |
| Polynomial Optimization, Efficiency through Moments and Algebra | |
| Organisation | Networks and Optimization |
|
de Klerk, E., & Laurent, M. (2020). Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere. Mathematical Programming, 193, 665–685. doi:10.1007/s10107-019-01465-1 |
|
