By Topic

Structured sum of squares for networked systems analysis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hancock, E.J. ; Dept. of Eng. Sci., Univ. of Oxford, Oxford, UK ; Papachristodoulou, A.

In this paper we introduce a structured Sum of Squares technique that enables Sum of Squares programming to be applied to networked systems analysis. By taking the structure of the network into account, we limit the size and number of decision variables in the LMI representation of the Sum of Squares, which improves the scalability of the technique for networked systems beyond taking advantage of symmetry and sparsity. We apply the technique to test non-negativity of fourth order structured polynomials in many variables and show that for these problems the technique has improved scalability over existing Sum of Squares techniques.

Published in:

Decision and Control and European Control Conference (CDC-ECC), 2011 50th IEEE Conference on

Date of Conference:

12-15 Dec. 2011