A reformulation converts complex SDPs to real SDPs more efficiently than the conventional method and yields faster runtimes on complex polynomial optimization relaxations.
W atrous, Semidefinite programs for completely bounded norms , Theory Comput., 5 (2009), pp
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A more efficient reformulation of complex SDP as real SDP
A reformulation converts complex SDPs to real SDPs more efficiently than the conventional method and yields faster runtimes on complex polynomial optimization relaxations.