Exploiting symmetries in SDP-relaxations for polynomial optimization

Details Exploiting symmetries in SDP-relaxations for polynomial optimization Exploiting symmetries in SDP-relaxations for polynomial optimization

2011-03-02

arxiv.org/abs/1103.0486v2

Mathematics

Optimization and Control

(v2) revision based on suggestions by referees

Scientific paper

In this paper we study various approaches for exploiting symmetries in polynomial optimization problems within the framework of semi definite programming relaxations. Our special focus is on constrained problems especially when the symmetric group is acting on the variables. In particular, we investigate the concept of block decomposition within the framework of constrained polynomial optimization problems, show how the degree principle for the symmetric group can be computationally exploited and also propose some methods to efficiently compute in the geometric quotient.

Affiliated with

Also associated with

No associations

Rating

Exploiting symmetries in SDP-relaxations for polynomial optimization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Exploiting symmetries in SDP-relaxations for polynomial optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exploiting symmetries in SDP-relaxations for polynomial optimization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-475280