Abstract
Sum of squares (SOS) decompositions for positive semidefinite polynomials are usually computed numerically, using convex optimization solvers. The precision of the decompositions can be improved by increasing the number of digits used in the computations, but, when the number of variables is greater than the length (i.e., the minimum number of squares needed for the decomposition) of the polynomial, it is difficult to obtain an exact SOS decomposition with the existing methods. A new algorithm, which works well in “almost all” such cases, is proposed here. The results of randomly generated experiments are reported to compare the proposed algorithm with those based on convex optimization.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
