next | previous | forward | backward | up | top | index | toc | Macaulay2 web site
SumsOfSquares :: SumsOfSquares

SumsOfSquares -- A package for sums-of-squares problems

Description

SumsOfSquares is a package to solve sums-of-squares (SOS) problems via semidefinite programming (SDP).

Introduction

Writing a polynomial as a sum of squares proves its nonnegativity for all arguments, but not all nonnegative polynomials are sum of squares. While nonnegativity of a polynomial is hard to check, there are efficient methods to find sums-of-squares decompositions, and this package makes some of them available in Macaulay2. These methods rely on semidefinite programming, an area from mathematical optimization. Several solvers (or tools) for semidefinite programming are available. The package SemidefiniteProgramming allows us to use some of these solvers in Macaulay2. The solver CSDP is included in Macaulay2 and can be used without any configuration. See Solver for how to use other solvers.

Usage examples

The most basic application is to (try to) decompose a polynomial as a sum of squares using the function solveSOS.
i1 : R = QQ[x,y];
i2 : f = 2*x^4 + 2*x^3*y - 2*x^2*y^2 + 5*y^4;
i3 : sol = solveSOS f;
The return value is an object of type SDPResult which, in the case of success, contains the sum-of-squares decomposition. It can be extracted with sosPoly. This returns an object of type SOSPoly, which supports many operations that polynomials support.
i4 : s = sosPoly sol

            83 2    2 2    43  20 2       2    231773   2 2
o4 = (5)(- ---x  + y )  + (--)(--x  + x*y)  + (------)(x )
           200             20  43              344000

o4 : SOSPoly
The command value(SOSPoly) can be used to check that the decomposition found matches the original polynomial.
i5 : value(s)

       4     3      2 2     4
o5 = 2x  + 2x y - 2x y  + 5y

o5 : R

Sums of squares modulo equality constraints

The package supports sum-of-squares problems in quotient rings. This can be useful to prove nonnegativity of a polynomial on a variety. The following example is taken from [P05]. Consider the problem of proving that the polynomial f = 10-x2-y is nonnegative on the circle defined by g = x2 + y2 - 1. To do this we check if f is a sum of squares in the quotient ring modulo g. For such a computation, a degree bound must be given by the user.
i6 : R = QQ[x,y];
i7 : S = R/ideal(x^2 + y^2 - 1);
i8 : f = 10-x^2-y;
i9 : sol = solveSOS (f, 2);
i10 : sosPoly sol

               1 2         2    83    2
o10 = (7)(y - --)  + (6)(x)  + (--)(1)
              14                28

o10 : SOSPoly
The previous computation gives decomposition with three sums of squares. See TraceObj for how to obtain a decomposition with only two squares.

Other cool stuff

On the role of the coefficient field

The SumsOfSquares package interfaces tries to hide some of the difficulties that arise from using these numerical procedures. See coefficient field for more information.

Literature

Authors

Certification a gold star

Version 2.1 of this package was accepted for publication in volume 10 of the journal The Journal of Software for Algebra and Geometry on 6 January 2020, in the article Sums of squares in Macaulay2. That version can be obtained from the journal or from the Macaulay2 source code repository, http://github.com/Macaulay2/M2/blob/master/M2/Macaulay2/packages/....m2, commit number 7623915208e2f52445cd73c9acd680027bba1d9c.

Version

This documentation describes version 2.1 of SumsOfSquares.

Source code

The source code from which this documentation is derived is in the file SumsOfSquares.m2. The auxiliary files accompanying it are in the directory SumsOfSquares/.

Exports

  • Types
    • SDPResult -- result of a semidefinite programming computation
    • SOSPoly -- A type to store sums-of-squares polynomials
  • Functions and commands
    • checkSolver -- tests a semidefinite programming solver
    • library -- library of interesting nonnegative forms
    • lowerBound -- finds a lower bound for a polynomial
    • recoverSolution -- factor a rank one positive semidefinite matrix
    • solveSOS -- solve a sum-of-squares problem
    • sosdecTernary -- sum of squares decomposition for ternary forms
    • sosInIdeal -- sum of squares polynomial in ideal
    • sosPoly -- make an SOS polynomial
  • Methods
    • clean(RR,SOSPoly) -- remove squares with very small coefficients from a sum of squares
    • recoverSolution(SDPResult), see recoverSolution -- factor a rank one positive semidefinite matrix
    • net(SDPResult), see SDPResult -- result of a semidefinite programming computation
    • status(SDPResult), see SDPResult -- result of a semidefinite programming computation
    • coefficients(SOSPoly), see SOSPoly -- A type to store sums-of-squares polynomials
    • expression(SOSPoly), see SOSPoly -- A type to store sums-of-squares polynomials
    • generators(SOSPoly), see SOSPoly -- A type to store sums-of-squares polynomials
    • length(SOSPoly), see SOSPoly -- A type to store sums-of-squares polynomials
    • Matrix == SOSPoly, see SOSPoly -- A type to store sums-of-squares polynomials
    • net(SOSPoly), see SOSPoly -- A type to store sums-of-squares polynomials
    • Number * SOSPoly, see SOSPoly -- A type to store sums-of-squares polynomials
    • ring(SOSPoly), see SOSPoly -- A type to store sums-of-squares polynomials
    • RingElement == SOSPoly, see SOSPoly -- A type to store sums-of-squares polynomials
    • SOSPoly * SOSPoly, see SOSPoly -- A type to store sums-of-squares polynomials
    • SOSPoly + SOSPoly, see SOSPoly -- A type to store sums-of-squares polynomials
    • SOSPoly == Matrix, see SOSPoly -- A type to store sums-of-squares polynomials
    • SOSPoly == RingElement, see SOSPoly -- A type to store sums-of-squares polynomials
    • SOSPoly == SOSPoly, see SOSPoly -- A type to store sums-of-squares polynomials
    • SOSPoly ^ ZZ, see SOSPoly -- A type to store sums-of-squares polynomials
    • substitute(SOSPoly,Ring), see SOSPoly -- A type to store sums-of-squares polynomials
    • sosPoly(SDPResult), see sosPoly -- make an SOS polynomial
    • value(SOSPoly) -- expansion of a weighted SOS decomposition
  • Symbols
    • RoundTol -- tolerance for rational rounding
    • GramMatrix, see SDPResult -- result of a semidefinite programming computation
    • MomentMatrix, see SDPResult -- result of a semidefinite programming computation
    • Status, see SDPResult -- result of a semidefinite programming computation
    • TraceObj -- whether to use trace as the objective function