SIAM Review
On the Convergence of the Central Path in Semidefinite Optimization
SIAM Journal on Optimization
Global Optimization with Polynomials and the Problem of Moments
SIAM Journal on Optimization
Optimization of Polynomials on Compact Semialgebraic Sets
SIAM Journal on Optimization
Computing sum of squares decompositions with rational coefficients
Theoretical Computer Science
Regularization Methods for Semidefinite Programming
SIAM Journal on Optimization
Convergent Relaxations of Polynomial Optimization Problems with Noncommuting Variables
SIAM Journal on Optimization
Optimization Methods & Software
Journal of Symbolic Computation
Hi-index | 0.00 |
This paper presents an algorithm and its implementation in the software package NCSOStools for finding sums of Hermitian squares and commutators decompositions for polynomials in noncommuting variables. The algorithm is based on noncommutative analogs of the classical Gram matrix method and the Newton polytope method, which allows us to use semidefinite programming. Throughout the paper several examples are given illustrating the results.