Philippe Moustrou, Cordian Riener, Hugues Verdure
Published 2023-05-09Version 1
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.
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
A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization
Convexification of polynomial optimization problems by means of monomial patterns
The Computational Complexity of Duality
![QR code for arXiv:2305.05219 [math.OC]](http://oss.arxitics.com/images/favicon.svg)