Given a symmetric n x n matrix - whose entries are polynomial functions (let's say of degree 1 but ideally higher degrees as well) of n variables $x_0 ... x_n$ - is there some established method to estimate the max possible singular value of the tensor over all x_i's bounded by the unit hypercube?
The only way I can think of, unfortunately, is grid search - sampling $\mathbf x$ and calculating largest singular values.
