complex semidefinite programming

Cuts and semidefinite liftings for the complex cut polytope

  • Lennart Sinjorgo
  • Renata Sotirov
  • Miguel F. Anjos
    • Categories Polyhedra, Semi-definite Programming, Telecommunications Tags , , , , ,

    We consider the complex cut polytope: the convex hull of Hermitian rank 1 matrices \(xx^{\mathrm{H}}\), where the elements of \(x \in \mathbb{C}^n\) are \(m\)th unit roots. These polytopes have applications in \({\text{MAX-3-CUT}}\), digital communication technology, angular synchronization and more generally, complex quadratic programming. For \({m=2}\), the complex cut polytope corresponds to the well-known cut polytope. … Read more

    A more efficient reformulation of complex SDP as real SDP

  • Jie Wang
    • Categories Global Optimization Theory, Semi-definite Programming Tags , , , ,

    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 … Read more