A more efficient reformulation of complex SDP as real SDP
Optimization and Control
2026-04-21 v4
Abstract
This note proposes a new reformulation of complex semidefinite programs (SDPs) as real SDPs. As an application, we present an economical reformulation of complex SDP relaxations of complex polynomial optimization problems as real SDPs and derive some further reductions by exploiting inner structure of the complex SDP relaxations. Various numerical examples demonstrate that our new reformulation runs significantly faster than the usual popular reformulation.
Cite
@article{arxiv.2307.11599,
title = {A more efficient reformulation of complex SDP as real SDP},
author = {Jie Wang},
journal= {arXiv preprint arXiv:2307.11599},
year = {2026}
}
Comments
14 pages