Thumbnail Image
Item

Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: Theory and software

Brosch,Daniel
; 
de Klerk,Etienne
Abstract
A common computational approach for polynomial optimization problems (POPs) is to use (hierarchies of) semidefinite programming (SDP) relaxations. When the variables in the POP are required to be nonnegative–as is the case for combinatorial optimization problems, for example–these SDP problems typically involve nonnegative matrices, i.e. they are conic optimization problems over the doubly nonnegative cone. The Jordan reduction, a symmetry reduction method for conic optimization, was recently introduced for symmetric cones by Parrilo and Permenter [Mathematical Programming 181(1), 2020]. We extend this method to the doubly nonnegative cone, and investigate its application to known relaxations of the quadratic assignment and maximum stable set problems. We also introduce new Julia software where the symmetry reduction is implemented.
Description
Date
2022
Journal Title
Journal ISSN
Volume Title
Publisher
Collections
Tilburg University Research Output Collection
Show all metadata
Files
Thumbnail Image
Jordan_reduction_Paper_revised_V3_no_color.pdf
Adobe PDF, 354.16 KB
Research Projects
Organizational Units
Journal Issue
Keywords
Quadratic assignment problem, maximum stable set, semidefinite programming, symmetry reduction
Citation
Brosch, D & de Klerk, E 2022, 'Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: Theory and software', Optimization Methods & Software, vol. 37, no. 6, pp. 2001-2020. https://doi.org/10.1080/10556788.2021.2022146
URI
https://hdl.handle.net/20.500.14602/75827
Embedded videos