Mathematics – Optimization and Control
Scientific paper
2009-03-06
Mathematics
Optimization and Control
15 pages
Scientific paper
10.1007/s10107-011-0457-z
A multivariate polynomial $p(x)=p(x_1,...,x_n)$ is sos-convex if its Hessian $H(x)$ can be factored as $H(x)= M^T(x) M(x)$ with a possibly nonsquare polynomial matrix $M(x)$. It is easy to see that sos-convexity is a sufficient condition for convexity of $p(x)$. Moreover, the problem of deciding sos-convexity of a polynomial can be cast as the feasibility of a semidefinite program, which can be solved efficiently. Motivated by this computational tractability, it has been recently speculated whether sos-convexity is also a necessary condition for convexity of polynomials. In this paper, we give a negative answer to this question by presenting an explicit example of a trivariate homogeneous polynomial of degree eight that is convex but not sos-convex. Interestingly, our example is found with software using sum of squares programming techniques and the duality theory of semidefinite optimization. As a byproduct of our numerical procedure, we obtain a simple method for searching over a restricted family of nonnegative polynomials that are not sums of squares.
Ahmadi Amir Ali
Parrilo Pablo A.
No associations
LandOfFree
A convex polynomial that is not sos-convex does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A convex polynomial that is not sos-convex, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A convex polynomial that is not sos-convex will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-670283