Dynamical system decomposition for efficient, sparse analysis

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2010, Pages 6565-6570

  Anderson, James ^a   Papachristodoulou, Antonis ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DECOMPOSITION; DYNAMICAL SYSTEMS; LARGE SCALE SYSTEMS;

DECISION VARIABLES; DECOMPOSITION APPROACH; EFFICIENT ANALYSIS; HIGH-DIMENSIONAL SYSTEMS; PROGRAMMING FRAMEWORK; SPARSE ANALYSIS; STATE PARTITION; SYSTEM DECOMPOSITION;

SYSTEM STABILITY;

EID: 79953127630     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2010.5717269     Document Type: Conference Paper

References (31)

1. S. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan, Linear Matrix Inequalities in System and Control Theory, ser. Studies in Applied Mathematics. Philadelphia, PA: SIAM, 1994, vol. 15.
2. H. K. Khalil, Nonlinear Systems, 3rd ed. Prentice Hall, Inc., 2001.
3. P. A. Parrilo, "Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization," Ph.D. dissertation, Caltech, Pasadena, CA, 2000.
4. A. Papachristodoulou and S. Prajna, "A tutorial on sum of squares techniques for systems analysis," in Proc. of the 2005 American Contol Conference, 2005.
5. L. Vandenberghe and S. Boyd, "Semidefinite programming," SIAM Review, vol. 38, no. 1, pp. 49-95, 1996.
6. C. Godsil and G. Royle, Algebraic Graph Theory. Springer-Verlag, Inc., 2000.
7. S. E. Karisch, F. Rendl, and J. Clausen, "Solving graph bisection problems with semidefinite programming," INFORMS Journal on Computing, vol. 12, no. 3, pp. 177-191, 2000.
8. G. Karypis and V. Kumar, "A fast and high quality multilevel scheme for partitioning irregular graphs," SIAM J. Sci. Comput., vol. 20, no. 1, pp. 359-392, 1998.
9. F. R. K. Chung, Spectral Graph Theory, ser. Regional conference series in mathematics. American Mathematical Society, 1997, no. 92.
10. M. E. J. Newman, "Modularity and community structure in networks," PNAS, vol. 103, pp. 8577-8582, 2006.
11. T. Evans and R. Lambiotte, "Line graphs, link partitions and overlapping communities," arXiv:0903.2181v2, 2009.
12. G. Palla, I. Derenyi, I. Farkas, and T. Vicsek, "Uncovering the overlapping community structure of complex networks in nature and society," Nature, vol. 435, pp. 814-818, 2005.
13. V. Nicosia, G. Mangioni, V. Carchiolo, and M. Malgeri, "Extending the definition of modularity to directed graphs with overlapping communities," Journal of Statistical Mechanics: Theory and Experiment, vol. 2009, no. 03, p. P03024, 2009.
14. J. Anderson and A. Papachristodoulou, "A network decomposition approach for efficient sum-of-squares programming based analysis," in Proceedings of the American Contol Conference, 2010.
15. -, "Input-output systems analysis using sum of squares programming: A decomposition approach," in Proceedings of the 19th International Symposium on Mathematical Theory of Networks and Systems, 2010.
16. T. Hu and Z. Lin, "Composite quadratic Lyapunov functions for constrained control systems," IEEE Transactions on Automatic Control, vol. 48, no. 3, pp. 440-450, 2003.
17. M. Ikeda and D. Siljak, "Generalized decompositions of dynamic systems and vector Lyapunov functions," Automatic Control, IEEE Transactions on, vol. 26, no. 5, pp. 1118-1125, 1981.
18. M. Ikeda, D. Siljak, and D. White, "An inclusion principle for dynamic systems," IEEE Transactions on Automatic Control, vol. 29, no. 3, pp. 244-249, 1984.
19. S. Prajna, A. Papachristodoulou, and P. A. Parrilo, "SOSTOOLS - Sum of Squares Optimization Toolbox, User's Guide," 2002, available at http://www.eng.ox.ac.uk/control/sostools/.
20. J. F. Sturm, "Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones," Optimization Methods and Software, vol. 11-12, pp. 625-653, 1999.
21. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge University Press, 2004.
22. B. Recht, M. Fazel, and P. A. Parrilo, "Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization," SIAM Review, vol. 52, no. 3, pp. 471-501, 2010.
23. M. X. Goemans and D. P. Williamson, "Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming," Journal of the ACM, vol. 42, pp. 1115-1145, 1995.
24. S. Dashkovskiy, H. Ito, and F. Wirth, "On a small gain theorem for ISS networks in dissipative Lyapunov form," in Proc. European Contr. Conf., 2009, pp. 1077-1082.
25. B. Reznick, "Extremal PSD forms with few terms," Duke Mathematical Journal, vol. 45, no. 2, pp. 363-374, 1978.
26. K. Gatermann and P. A. Parrilo, "Symmetry groups, semidefinite programs, and sums of squares," Journal of Pure and Applied Algebra, vol. 192, no. 1-3, pp. 95-128, 2004.
27. B. Sturmfels, "Polynomial equations and convex polytopes," American Mathematical Monthly, vol. 105, no. 10, pp. 907-922, 1998.
28. D. L. Donoho and P. B. Stark, "Uncertainty principles and signal recovery," SIAM J. Appl. Math., vol. 49, no. 3, p. 906931, 1989.
29. A. Hassibi, J. How, and S. Boyd, "Low-authority controller design via convex optimization," AIAA Journal of Guidance, Control, and Dynamics, vol. 22, no. 6, pp. 862-872, 1999.
30. A. Papachristodoulou and B. Recht, "Determining interconnections in chemical reaction networks," in Proceedings of the 2007 American Control Conference, 2007, pp. 4872-4877.
31. J. Löfberg, "Pre- and post-processing sum-of-squares programs in practice," IEEE Transactions on Automatic Control, vol. 54, no. 5, 2009.