Symmetries in Polynomial Optimization

Philippe Moustrou (), Cordian Riener () and Hugues Verdure ()
Additional contact information
Philippe Moustrou: Université Toulouse Jean Jaurès
Cordian Riener: UiT - Norges arktiske universitet
Hugues Verdure: UiT - Norges arktiske universitet

A chapter in Polynomial Optimization, Moments, and Applications, 2023, pp 53-111 from Springer

Abstract: 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.

Date: 2023
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-031-38659-6_3

Ordering information: This item can be ordered from
http://www.springer.com/9783031386596

DOI: 10.1007/978-3-031-38659-6_3

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().