Title :
A positive definite polynomial Hessian that does not factor
Author :
Ahmadi, Amir Ali ; Parrilo, Pablo A.
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Massachusetts Inst. of Technol., Cambridge, MA, USA
Abstract :
The notion of sos-convexity has recently been proposed as a tractable sufficient condition for convexity of polynomials based on a sum of squares decomposition of the Hessian matrix. A multivariate polynomial p(x) = p(x1,...,xn)is said to be sos-convex if its Hessian H(x) can be factored as H(x) = MT(x)M(x) with a possibly nonsquare polynomial matrix M(x). The problem of deciding sos-convexity of a polynomial can be reduced to the feasibility of a semidefinite program, which can be checked efficiently. Motivated by this computational tractability, it has been speculated whether every convex polynomial must necessarily be sos-convex. In this paper, we answer this question in the negative by presenting an explicit example of a trivariate homogeneous polynomial of degree eight that is convex but not sos-convex.
Keywords :
Hessian matrices; convex programming; polynomial matrices; Hessian matrix; computational tractability; convex polynomial; multivariate polynomial; nonsquare polynomial matrix; polynomial convexity; positive definite polynomial Hessian; semidefinite program; sos-convexity; sum of squares decomposition; trivariate homogeneous polynomial; Algebra; Bridges; Complexity theory; Laboratories; Lyapunov method; Mathematics; Matrix decomposition; Polynomials; Sufficient conditions; Testing;
Conference_Titel :
Decision and Control, 2009 held jointly with the 2009 28th Chinese Control Conference. CDC/CCC 2009. Proceedings of the 48th IEEE Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-3871-6
Electronic_ISBN :
0191-2216
DOI :
10.1109/CDC.2009.5400519