A positive definite polynomial Hessian that does not factor

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2009, Pages 1195-1200

  Ahmadi, Amir Ali ^a   Parrilo, Pablo A ^a  

^a Department of Electrical Engineering and Computer Science   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTROL ENGINEERING;

COMPUTATIONAL TRACTABILITY; HESSIAN MATRICES; HOMOGENEOUS POLYNOMIALS; MULTIVARIATE POLYNOMIAL; POLYNOMIAL MATRICES; POSITIVE DEFINITE; SEMIDEFINITE PROGRAMS; SUM OF SQUARES DECOMPOSITIONS;

POLYNOMIALS;

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

References (32)

1. P. A. Parrilo and B. Sturmfels. Minimizing polynomial functions. Algorithmic and Quantitative Real Algebraic Geometry, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 60:83-99, 2003.
2. P. A. Parrilo. Semidefinite programming relaxations for semialgebraic problems. Math. Prog., 96(2, Ser. B):293-320, 2003.
3. K. G. Murty and S. N. Kabadi. Some NP-complete problems in quadratic and nonlinear programming. Mathematical Programming, 39:117-129, 1987.
4. P. M. Pardalos and S. A. Vavasis. Open questions in complexity theory for numerical optimization. Mathematical Programming, 57(2):337-339, 1992.
5. B. Guo. On the difficulty of deciding the convexity of polynomials over simplexes. International Journal of Computational Geometry and Applications, 6(2):227-229, 1996.
6. J.W. Helton and J. Nie. Semidefinite representation of convex sets. Mathematical Programming Series A, 122:21-64, 2010.
7. J. B. Lasserre. Convexity in semialgebraic geometry and polynomial optimization. SIAM Journal on Optimization, 19(4):1995-2014, 2009.
8. J. B. Lasserre. A convex Positivstellensatz. arXiv:0801.3754v1, 2008.
9. th IEEE Conference on Decision and Control, 2005.
10. G. Chesi and Y. S. Hung. Establishing convexity of polynomial Lyapunov functions and their sublevel sets. IEEE Trans. Automat. Control, 53(10):2431-2436, 2008.
11. T. S. Motzkin. The arithmetic-geometric inequality. In Inequalities (Proc. Sympos. Wright-Patterson Air Force Base, Ohio, 1965), pages 205-224. Academic Press, New York, 1967.
12. R. M. Robinson. Some definite polynomials which are not sums of squares of real polynomials. In Selected questions of algebra and logic (collection dedicated to the memory of A. I. Mal'cev) (Russian), pages 264-282. Izdat. "Nauka" Sibirsk. Otdel., Novosibirsk, 1973.
13. K. Schmüdgen. An example of a positive polynomial which is not a sum of squares of polynomials. A positive, but not strongly positive functional. Math. Nachr., 88:385-390, 1979.
14. M. D. Choi. Positive semidefinite biquadratic forms. Linear Algebra and its Applications, 12:95-100, 1975.
15. A. A. Ahmadi and P. A. Parrilo. A convex polynomial that is not sos-convex. MIT LIDS technical report 2810. arXiv:0903.1287, 2009.
16. D. Hilbert. Über die Darstellung definiter Formen als Summe von Formenquadraten. Math. Ann., 32(3), 1888.
17. B. Reznick. Some concrete aspects of Hilbert's 17th problem. In Contemporary Mathematics, volume 253, pages 251-272. American Mathematical Society, 2000.
18. D. Henrion and A. Garulli, editors. Positive polynomials in control, volume 312 of Lecture Notes in Control and Information Sciences. Springer, 2005.
19. N. Z. Shor. Class of global minimum bounds of polynomial functions. Cybernetics, 23(6):731-734, 1987.
20. (Russian orig.: Kibernetika, No. 6, (1987), 9-11).
21. Yu. Nesterov. Squared functional systems and optimization problems. In High performance optimization, volume 33 of Appl. Optim., pages 405-440. Kluwer Acad. Publ., Dordrecht, 2000.
22. P. A. Parrilo. Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. PhD thesis, California Institute of Technology, May 2000.
23. L. Vandenberghe and S. Boyd. Semidefinite programming. SIAM Review, 38(1):49-95, March 1996.
24. S. Prajna, A. Papachristodoulou, and P. A. Parrilo. SOSTOOLS: Sum of squares optimization toolbox for MATLAB, 2002-2005. Available from http://www.cds.caltech.edu/sostools and http://www.mit.edu/~parrilo/sostools.
25. H. Peyrl and P. A. Parrilo. Computing sum of squares decompositions with rational coefficients. Theoretical Computer Science, 409(2):269-281, 2008.
26. S. Boyd and L. Vandenberghe. Convex optimization. Cambridge University Press, 2004.
27. M. Kojima. Sums of squares relaxations of polynomial semidefinite programs. Research report B-397, Dept. of Mathematical and Computing Sciences. Tokyo Institute of Technology, 2003.
28. K. Gatermann and P. A. Parrilo. Symmetry groups, semidefinite programs, and sums of squares. Journal of Pure and Applied Algebra, 192:95-128, 2004.
29. C. W. Scherer and C. W. J. Hol. Matrix sum of squares relaxations for robust semidefinite programs. Mathematical Programming, 107:189-211, 2006.
30. M. D. Choi, T.-Y. Lam, and B. Reznick. Real zeros of positive semidefinite forms. I. Math. Z., 171(1):1-26, 1980.
31. th IEEE Conference on Decision and Control, 2007.
32. J. Sturm. SeDuMi version 1.05, October 2001. Available from http://sedumi.ie.lehigh.edu.