## A hierarchy of eigencomputations for polynomial optimization on the sphere

**Abstract:**

We introduce a convergent hierarchy of lower bounds on the minimum value of a real homogeneous polynomial over the sphere. The main practical advantage of our hierarchy over the sum-of-squares (SOS) hierarchy is that the lower bound at each level of our hierarchy is obtained by a minimum eigenvalue computation, as opposed to the full semidefinite program (SDP) required at each level of SOS. In practice, this allows us to go to much higher levels than are computationally feasible for the SOS hierarchy. For both hierarchies, the underlying space at the k-th level is the set of homogeneous polynomials of degree 2k. We prove that our hierarchy converges as O(1/k) in the level k, matching the best-known convergence of the SOS hierarchy when the number of variables n is less than the half-degree d (the best-known convergence of SOS when n ≥ d is O(1/k^2)). More generally, we introduce a convergent hierarchy of minimum eigenvalue computations for minimizing the inner product between a real tensor and an element of the spherical Segre-Veronese variety, with similar convergence guarantees. As examples, we obtain hierarchies for computing the (real) tensor spectral norm, and for minimizing biquadratic forms over the sphere. Hierarchies of eigencomputations for more general constrained polynomial optimization problems are discussed.

**Authors:**

- Nathaniel Johnston
- Benjamin Lovitz
- Aravindan Vijayaraghavan

** ****Download:**

- Preprint from arXiv:2310.17827 [math.OC]
- Local preprint [pdf]

** ****Cite as:**

- N. Johnston, B. Lovitz, and A. Vijayaraghavan.
*A hierarchy of eigencomputations for polynomial optimization on the sphere*. E-print: arXiv:2310.17827 [math.OC], 2023.