Symmetries in polynomial optimization
Optimization and Control
2023-05-10 v1
Abstract
This chapter investigates how symmetries can be used to reduce the computational complexity in polynomial optimization problems. A focus will be specifically given on the Moment-SOS hierarchy in polynomial optimization, where results from representation theory and invariant theory of groups can be used. In addition, symmetry reduction techniques which are more generally applicable are also presented.
Cite
@article{arxiv.2305.05219,
title = {Symmetries in polynomial optimization},
author = {Philippe Moustrou and Cordian Riener and Hugues Verdure},
journal= {arXiv preprint arXiv:2305.05219},
year = {2023}
}
Comments
This chapter will appear as part of a forthcoming book "Polynomial Optimisation, Moments, and Applications" presenting research acitivies conducted in the Marie Sk{\l}odowska-Curie Innovative Training Network POEMA