## Abstract

Our first contribution in this paper is to prove that three natural sum of squares (sos) based sufficient conditions for convexity of polynomials, via the definition of convexity, its first order characterization, and its second order characterization, are equivalent. These three equivalent algebraic conditions, henceforth referred to as sos-convexity, can be checked by semidefinite programming, whereas deciding convexity is NP-hard. If we denote the set of convex and sos-convex polynomials in n variables of degree d with C̃_{n,d} and ∑C̃_{n,d} respectively, then our main contribution is to prove that C̃_{n,d} = ∑C̃ _{n,d} if and only if n = 1 or d = 2 or (n, d) = (2, 4). We also present a complete characterization for forms (homogeneous polynomials) except for the case (n, d) = (3, 4), which is joint work with Blekherman and is to be published elsewhere. Our result states that the set C_{n,d} of convex forms in n variables of degree d equals the set ∑C_{n,d} of sos-convex forms if and only if n = 2 or d = 2 or (n, d) = (3, 4). To prove these results, we present in particular explicit examples of polynomials in C̃_{2,6}\ ∑C̃_{2,6} and C̃_{3,4}\∑C̃_{3,4} and forms in C_{3,6}\∑C_{3,6} and C_{4,4}\ ∑C_{4,4}, and a general procedure for constructing forms in C _{n,d+2}\∑C_{n,d+2} from nonnegative but not sos forms in n variables and degree d. Although for disparate reasons, the remarkable outcome is that convex polynomials (resp., forms) are sos-convex exactly in cases where nonnegative polynomials (resp., forms) are sums of squares, as characterized by Hilbert.

Original language | English (US) |
---|---|

Pages (from-to) | 811-833 |

Number of pages | 23 |

Journal | SIAM Journal on Optimization |

Volume | 23 |

Issue number | 2 |

DOIs | |

State | Published - 2013 |

Externally published | Yes |

## All Science Journal Classification (ASJC) codes

- Software
- Theoretical Computer Science

## Keywords

- Convexity
- Semidefinite programming
- Sum of squares