Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials
 
research article

Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials

Burgdorf, Sabine  
•
Cafuta, Kristijan
•
Klep, Igor
Show more
2013
Computational Optimization And Applications

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.

  • Details
  • Metrics
Type
research article
DOI
10.1007/s10589-012-9513-8
Web of Science ID

WOS:000317468600006

Author(s)
Burgdorf, Sabine  
•
Cafuta, Kristijan
•
Klep, Igor
•
Povh, Janez
Date Issued

2013

Publisher

Springer

Published in
Computational Optimization And Applications
Volume

55

Issue

1

Start page

137

End page

153

Subjects

Sum of squares

•

Semidefinite programming

•

Noncommutative polynomial

•

Matlab toolbox

•

Newton polytope

•

Free positivity

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
EGG  
Available on Infoscience
October 1, 2013
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/95468
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés