Complexity in automation of SOS proofs: An illustrative example

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2006, Pages 5851-5856

  Gayme, Dennice ^a   Fazel, Maryam ^a   Doyle, John C ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; AUTOMATION; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; THEOREM PROVING;

AUTOMATED PROOF SYSTEMS; CHAOTIC DYNAMICAL SYSTEMS; LOGISTIC MAP;

CHAOTIC SYSTEMS;

EID: 39649088706     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/cdc.2006.377629     Document Type: Conference Paper

References (22)

1. S. Basu, R. Pollack, and M.F. Roy. Algorithms in Real Algebraic Geometry. Springer-Verlag, 2003.
2. J. Bochnak, M. Coste, and M. F. Roy. Real Algebraic Geometry. A Series of Modern Surveys in Mathematics. Springer-Verlag, 1998.
3. R. Devaney. An Introduction to Chaotic Dynamical Systems. Addison-Wesley, 2nd edition, 1989.
4. M. Fazel and M. Chiang. Network utility maximization with nonconcave utilities using Sum-of-Squares method. In Proceedings of the 44th IEEE Control and Decision Conference, 2005.
5. D. Grigoriev and N. Vorobjov. Complexity of Null- and Positivstellensatz proofs. Annals Pure and Applied Logic, 113:153-160, 2001.
6. D. Handelman. Representing polynomials by positive linear functions on compact convex polyhedra. Pacific J. Math., 132:35-62, 1988.
7. J. B. Lasserre. Global optimization with polynomials and the problems of moments. SIAM Journal of Optimization, 11:796-817, 2001.
8. K. G. Murty and S. N. Kabadi. Some NP-complete problems in quadratic and nonlinear programming. Math. Prog., 39:117-129, 1987.
9. J. Nie and M. Schweighofer. On the complexity of Putinar's Positivstellensatz. eprint arXiv:math/0510309, October 2005.
10. A. Papachristodoulou. Scalable Analysis of Nonlinear Systems Using Convex Optimization. PhD thesis, Caltech, Pasadena, CA, 2005.
11. A. Papachristodoulou and S. Prajna. On the construction of Lyapunov functions using the Sum of Squares decomposition. In Proceedings of the 41st IEEE Conf. on Decision and Control, 2002.
12. P. A. Parrilo. Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization. PhD thesis, Caltech, Pasadena, CA, 2001.
13. H. O. Peitgen, H Jurgens, and D. Saupe. Chaos and Fractals: New Frontiers of Science. Springer-Verlag, 1992.
14. S. Prajna. Optimization-Based Methods for Nonlinear and Hybrid Systems Verification. PhD thesis, Caltech, Pasadena, CA, 2005.
15. S. Prajna, A. Papachristodoulou, and P. A. Parrilo. SOSTOOLS: Sum of Squares Optimization Toolbox for MATLAB: User's guide. Caltech, Pasadena, California, 2002. Available at http://www.cds.caltech.edu/sostools.
16. S. Prajna, A. Papachristodoulou, and P.A. Parrilo. Introducing SOSTOOLS: A general purpose Sum of Squares programming solver. In Proceedings of the 41st IEEE Conf. on Decision and Control, 2002.
17. M. Putinar. Positive polynomials on compact semi-algebraic sets. Indiana Univ. Math. J., 42:969-984, 1993.
18. K. Schmudgen. The k-moment problem for compact semialgebraic sets. Math. Ann., 289:203-206, 1991.
19. N. Z. Shor. Class of global minimum bounds of polynomial functions. Cybernetics and Systems Analysis, 23:731-734, 1987.
20. G. Stengle. A Nullstellensatz and a Positivstellensatz in semialgebraic geometry. Mathematische Annalen, 207:67-97, 1974.
21. G. Stengle. Complexity estimates for the Schmudgen Positivstellensatz. J. Complexity, 12(2):167-174, 1996.
22. J. F. Strum. Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones (updated for version 1.05). Optimization Methods and Software, 11-12:625-653, 1999 (for verions 1.02/1.03). Updated in 2001 and available from http://sedumi.mcmaster.ca.