4.6 Article

A convex polynomial that is not sos-convex

期刊

MATHEMATICAL PROGRAMMING
卷 135, 期 1-2, 页码 275-292

出版社

SPRINGER HEIDELBERG
DOI: 10.1007/s10107-011-0457-z

关键词

Convexity; Sos-convexity; Sum of squares; Semidefinite programming

资金

  1. MURI AFOSR [FA9550-06-1-0303]
  2. NSF FRG [0757207]
  3. Direct For Mathematical & Physical Scien
  4. Division Of Mathematical Sciences [0757207] Funding Source: National Science Foundation

向作者/读者索取更多资源

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 is natural to study 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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据