Semidefinite programming and sums of hermitian squares of noncommutative polynomials

  • Igor Klep
  • Janez Povh
    • Categories Optimization Software Design Principles, Semi-definite Programming Tags , , , Short URL: https://optimization-online.org/?p=10804

    An algorithm for finding sums of hermitian squares decompositions for polynomials in noncommuting variables is presented. The algorithm is based on the “Newton chip method”, a noncommutative analog of the classical Newton polytope method, and semide finite programming.

    Citation

    I. Klep and J. Povh. Semide nite programming and sums of hermitian squares of noncommutative polynomials. J. Pure Appl. Algebra, 214:740-749, 2010.

    Article

    Download

    View PDF