Projects per year
Abstract
Every convex homogeneous polynomial (or form) is nonnegative. Blekherman has shown that there exist convex forms that are not sums of squares via a nonconstructive argument. We provide an explicit example of a convex form of degree 4 in 272 variables that is not a sum of squares. The form is related to the Cauchy-Schwarz inequality over the octonions. The proof uses symmetry reduction together with the fact (due to Blekherman) that forms of even degree that are near-constant on the unit sphere are convex. Using this same connection, we obtain improved bounds on the approximation quality achieved by the basic sum-of-squares relaxation for optimizing quaternary quartic forms on the sphere.
| Original language | English |
|---|---|
| Pages (from-to) | 569-582 |
| Number of pages | 14 |
| Journal | Mathematics of Operations Research |
| Volume | 48 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Feb 2023 |
Keywords
- convexity
- sums of squares
- octonions
- Cauchy-Schwarz inequality
- semidefinite programming
Projects
- 1 Active
-
Realising the potential of hyperbolic programming
Saunderson, J. (Primary Chief Investigator (PCI))
1/03/21 → 11/12/26
Project: Research