Semidefinite programming and sums of hermitian squares of noncommutative polynomials

Igor Klep (igor.klepfmf.uni-lj.si)
Janez Povh (janez.povhfis.unm.si)

Abstract: 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.

Keywords: noncommutative polynomial, sum of squares, semidefinite programming, Newton polytope

Category 1: Linear, Cone and Semidefinite Programming (Semi-definite Programming )

Category 2: Optimization Software and Modeling Systems (Optimization Software Design Principles )

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.

Download: [PDF]

Entry Submitted: 07/22/2009
Entry Accepted: 07/22/2009
Entry Last Modified: 03/21/2011

Modify/Update this entry