On the computational complexity of gap-free duals for semidefinite programming

  • Imre Pólik
  • Tamás Terlaky
    • Categories Semi-definite Programming Tags , , , , , Short URL: https://optimization-online.org/?p=10828

    We consider the complexity of gap-free duals in semidefinite programming. Using the theory of homogeneous cones we provide a new representation of Ramana’s gap-free dual and show that the new formulation has a much better complexity than originally proved by Ramana.

    Citation

    COR@L Technical Report, Lehigh University

    Article

    Download

    View PDF