Semidefinite programming and sums of hermitian squares of noncommutative polynomials
Igor Klep (igor.klepfmf.uni-lj.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 semidefinite programming.
Keywords: noncommutative polynomial, sum of squares, semidefinite 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. Semidenite programming and sums of hermitian squares of noncommutative polynomials. J. Pure Appl. Algebra, 214:740-749, 2010.
Entry Submitted: 07/22/2009
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|