An algorithm for decomposing a non-negative polynomial as a sum of squares of rational functions

DOI10.1007/s11075-014-9903-3zbMath1317.65117OpenAlexW1981158071MaRDI QIDQ2351490

Marc Van Barel, Thanh Hieu Le

Publication date: 23 June 2015

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-014-9903-3

zbMATH Keywords

algorithmnumerical experimentsum of squaresnonnegative polynomialsum of squares of rational functionsChoi-Lam polynomialsMotzkin polynomialsRobinson polynomials

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04)

Related Items (1)

A practical approach to SOS relaxations for detecting quantum entanglement

Uses Software

• Macaulay2
• Sostools
• CVX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Pythagoras number of real sum of squares polynomials and sum of square magnitudes of polynomials
• Efficient and accurate computation of upper bounds of approximation errors
• Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
• SOS approximations of nonnegative polynomials via simple high degree perturbations
• Extremal positive semidefinite forms
• Semidefinite programming relaxations for semialgebraic problems
• Uniform denominators in Hilbert's seventeenth problem
• Computing sum of squares decompositions with rational coefficients
• Sums of squares over totally real fields are rational sums of squares
• SOSTOOLS and Its Control Applications
• A Sum of Squares Approximation of Nonnegative Polynomials
• On the absence of uniform denominators in Hilbert’s 17th problem
• Sur la représentation en somme de carrés des polynômes à une indéterminée sur un corps de nombres algébriques

This page was built for publication: An algorithm for decomposing a non-negative polynomial as a sum of squares of rational functions