Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2505.18580 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908429220577280 |
|---|---|
| author | Magron, Victor |
| author_facet | Magron, Victor |
| contents | We consider polynomial optimization problems on Cartesian products of basic compact semialgebraic sets. The solution of such problems can be approximated as closely as desired by hierarchies of semidefinite programming relaxations, based on classical sums of squares certificates due to Putinar and Schmüdgen. When the feasible set is the bi-sphere, i.e., the Cartesian product of two unit spheres, we show that the hierarchies based on the Schmüdgen-type certificates converge to the global minimum of the objective polynomial at a rate in $O(1/t^2)$, where $t$ is the relaxation order. Our proof is based on the polynomial kernel method. We extend this result to arbitrary sphere products and give a general recipe to obtain convergence rates for polynomial optimization over products of distinct sets. Eventually, we rely on our results for the bi-sphere to analyze the speed of convergence of a semidefinite programming hierarchy approximating the order $2$ quantum Wasserstein distance. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_18580 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Convergence rates for polynomial optimization on set products Magron, Victor Optimization and Control We consider polynomial optimization problems on Cartesian products of basic compact semialgebraic sets. The solution of such problems can be approximated as closely as desired by hierarchies of semidefinite programming relaxations, based on classical sums of squares certificates due to Putinar and Schmüdgen. When the feasible set is the bi-sphere, i.e., the Cartesian product of two unit spheres, we show that the hierarchies based on the Schmüdgen-type certificates converge to the global minimum of the objective polynomial at a rate in $O(1/t^2)$, where $t$ is the relaxation order. Our proof is based on the polynomial kernel method. We extend this result to arbitrary sphere products and give a general recipe to obtain convergence rates for polynomial optimization over products of distinct sets. Eventually, we rely on our results for the bi-sphere to analyze the speed of convergence of a semidefinite programming hierarchy approximating the order $2$ quantum Wasserstein distance. |
| title | Convergence rates for polynomial optimization on set products |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2505.18580 |