A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Pre- and Post-Processing Sum-of-Squares Programs in Practice
2009
IEEE Transactions on Automatic Control
Checking non-negativity of polynomials using sum-ofsquares has recently been popularized and found many applications in control. Although the method is based on convex programming, the optimization problems rapidly grow and result in huge semidefinite programs. Additionally, they often become increasingly ill-conditioned. To alleviate these problems, it is important to exploit properties of the analyzed polynomial, and post-process the obtained solution. This paper describes how the
doi:10.1109/tac.2009.2017144
fatcat:yufyuutivrh5rnulblzaqiklpu