Change search
ReferencesLink to record
Permanent link

Direct link
Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
Umeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.
2013 (English)In: Mathematics of Operations Research, ISSN 0364-765X, E-ISSN 1526-5471, Vol. 38, no 1, 122-141 p.Article in journal (Refereed) Published
Abstract [en]

In this paper we study various approaches for exploiting symmetries in polynomial optimization problems within the framework of semidefinite 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 the geometric quotient.

Place, publisher, year, edition, pages
2013. Vol. 38, no 1, 122-141 p.
Keyword [en]
polynomial optimization, semidefinite programming, semidefinite relaxation symmetry, symmetric group, constrained optimization
National Category
Discrete Mathematics
URN: urn:nbn:se:umu:diva-67602DOI: 10.1287/moor.1120.0558ISI: 000315190000006OAI: diva2:624834
Available from: 2013-06-03 Created: 2013-03-25 Last updated: 2013-06-03Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Jansson Andren, Lina
By organisation
Department of Mathematics and Mathematical Statistics
In the same journal
Mathematics of Operations Research
Discrete Mathematics

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 24 hits
ReferencesLink to record
Permanent link

Direct link