solveSOS(f,mon)
solveSOS(f,objFun,mon)
solveSOS(f,D)
solveSOS(f,objFun,D)
This method allows to compute sums-of-square decompositions in quotient rings. A vector of monomials must be provided in this case.
|
|
|
|
If a degree bound $D$ is given, the method will use the vector of monomials of degree at most $D/2$.
|
Parametrized sums-of-squares problems can also be solved in quotient rings.
|
|
Caveat
The rational rounding may also fail in quotient ring computations. In this case, the object SOSPoly constructed from the object SDPResult can live in a newly created ring, instead of the quotient that one started with.
|
|
|
|
|
The above ring is not a quotient ring. One can construct a new quotient ring and work there. However, this will only work reliably for principal ideals, as otherwise the Gröbner basis engine might fail due to inexact computations.
|
|
|