A Macaulay 2 package for computing sum of squares decompositions of polynomials with rational coefficients

Authors:
Helfried Peyrl;Pablo A. Parrilo
Affiliations:
ETH Zurich, Zurich, Switzerland;Massachusetts Institute of Technology, Cambridge, MA
Venue:
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Year:
2007

Citing 1
Cited 5

Semidefinite programming

SIAM Review

Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars

Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
A proof of the monotone column permanent (MCP) conjecture for dimension 4 via sums-of-squares of rational functions

Proceedings of the 2009 conference on Symbolic numeric computation
The minimum-rank gram matrix completion via modified fixed point continuation method

Proceedings of the 36th international symposium on Symbolic and algebraic computation
Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients

Journal of Symbolic Computation
Computing Rational Points in Convex Semialgebraic Sets and Sum of Squares Decompositions

SIAM Journal on Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In recent years semideffinite programming (SDP) has become the standard technique for computing sum of squares (SOS) decompositions of nonnegative polynomials. Due to the nature of the underlying methods, the solutions are computed numerically, and thus are never exact. In this paper we present a software package for Macaulay 2, which aims at computing an exact SOS decomposition from a numerical solution.