Journal
IEEE TRANSACTIONS ON AUTOMATIC CONTROL
Volume 54, Issue 5, Pages 1007-1011Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TAC.2009.2017144
Keywords
Optimization methods; polynomials; software packages
Ask authors/readers for more resources
Checking non-negativity of polynomials using sum-of-squares 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 technical note describes how the sum-of-squares module in the MATLAB toolbox YALMIP handles these issues.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available