Symmetry Detection for Quadratic Optimization Using Binary Layered Graphs

Symmetry in mathematical optimization may create multiple, equivalent solutions. In nonconvex optimization, symmetry can negatively affect algorithm performance, e.g., of branch-and-bound when symmetry induces many equivalent branches. This paper develops detection methods for symmetry groups in qua...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Processes Ročník 7; číslo 11; s. 838
Hlavní autoři: Kouyialis, Georgia, Wang, Xiaoyu, Misener, Ruth
Médium: Journal Article
Jazyk:angličtina
Vydáno: Basel MDPI AG 01.11.2019
Témata:
Algorithms
Approximation
Arrays
Equivalence
Graph representations
Graph theory
Graphical representations
Graphs
Integer programming
Optimization
Packing problem
Symmetry
Symmetry detection
Variables
ISSN:2227-9717, 2227-9717
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Symmetry in mathematical optimization may create multiple, equivalent solutions. In nonconvex optimization, symmetry can negatively affect algorithm performance, e.g., of branch-and-bound when symmetry induces many equivalent branches. This paper develops detection methods for symmetry groups in quadratically-constrained quadratic optimization problems. Representing the optimization problem with adjacency matrices, we use graph theory to transform the adjacency matrices into binary layered graphs. We enter the binary layered graphs into the software package nauty that generates important symmetric properties of the original problem. Symmetry pattern knowledge motivates a discretization pattern that we use to reduce computation time for an approximation of the point packing problem. This paper highlights the importance of detecting and classifying symmetry and shows that knowledge of this symmetry enables quick approximation of a highly symmetric optimization problem.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2227-9717
2227-9717
DOI:10.3390/pr7110838