A Facial Reduction Algorithm for Finding Sparse SOS Representations

  • Masakazu Muramatsu
  • Hayato Waki
    • Categories Convex Optimization, Global Optimization Theory, Semi-definite Programming Tags , , , Short URL: https://optimization-online.org/?p=10967

    Facial reduction algorithm reduces the size of the positive semidefinite cone in SDP. The elimination method for a sparse SOS polynomial ([3]) removes unnecessary monomials for an SOS representation. In this paper, we establish a relationship between a facial reduction algorithm and the elimination method for a sparse SOS polynomial.

    Citation

    Technical Report CS-09-02, Department of Computer Science, The University of Electro-Communications.

    Article

    Download

    View A Facial Reduction Algorithm for Finding Sparse SOS Representations