Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials

Sabine Burgdorf (), Kristijan Cafuta (), Igor Klep () and Janez Povh ()

Computational Optimization and Applications, 2013, vol. 55, issue 1, 137-153

Abstract: 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. Copyright Springer Science+Business Media New York 2013

Keywords: Sum of squares; Semidefinite programming; Noncommutative polynomial; Matlab toolbox; Newton polytope; Free positivity (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s10589-012-9513-8 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:55:y:2013:i:1:p:137-153

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-012-9513-8

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().