Computing sum of squares decompositions with rational coefficients

@article{Peyrl2008ComputingSO,
  title={Computing sum of squares decompositions with rational coefficients},
  author={Helfried Peyrl and Pablo A. Parrilo},
  journal={Theor. Comput. Sci.},
  year={2008},
  volume={409},
  pages={269-281}
}
Sum of squares (SOS) decompositions for nonnegative polynomials are usually computed numerically, using convex optimization solvers. Although the underlying floating point methods in principle allow for numerical approximations of arbitrary precision, the computed solutions will never be exact. In many applications such as geometric theorem proving, it is of interest to obtain solutions that can be exactly verified. In this paper, we present a numeric–symbolic method that exploits the… CONTINUE READING
BETA

Citations

Publications citing this paper.
SHOWING 1-10 OF 45 CITATIONS, ESTIMATED 50% COVERAGE

90 Citations

01020'10'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 90 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-10 OF 41 REFERENCES

Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization

  • P. A. Parrilo
  • Ph.D. Thesis, California Institute of Technology…
  • 2008
2 Excerpts

Gloptipoly 3

  • D. Henrion, J. B. Lasserre, J. Löfberg
  • Available from http://www.laas.fr/∼henrion…
  • 2007
1 Excerpt

SOS.m2, a sum of squares package for Macaulay 2. Available from http://www.control.ee.ethz.ch/∼hpeyrl/index.php

  • H. Peyrl, P. A. Parrilo
  • 2007
1 Excerpt

Similar Papers

Loading similar papers…