
arXiv: 2404.14440
We prove that convex ternary quartic forms are sum-of-squares-convex (sos-convex). This result is in a meaningful sense the ``convex analogue'' a celebrated theorem of Hilbert from 1888, where he proves that nonnegative ternary quartic forms are sums of squares. We show by an appropriate construction that exploiting the structure of the Hessian matrix is crucial in any possible proof of our result.
15 pages
Polynomial optimization, convexity, semidefinite programming, Computational aspects related to convexity, algebraic methods, Mathematics - Algebraic Geometry, Optimization and Control (math.OC), polynomial optimization, FOS: Mathematics, sos-convexity, Semidefinite programming, sum of squares, Mathematics - Optimization and Control, Algebraic Geometry (math.AG)
Polynomial optimization, convexity, semidefinite programming, Computational aspects related to convexity, algebraic methods, Mathematics - Algebraic Geometry, Optimization and Control (math.OC), polynomial optimization, FOS: Mathematics, sos-convexity, Semidefinite programming, sum of squares, Mathematics - Optimization and Control, Algebraic Geometry (math.AG)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
