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

Daniel Brosch, Etienne de Klerk

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…