Unit balls of constant volume: which one has optimal representation?

Abstract

In the family of unit balls with constant volume we look at the ones whose algebraic representation has some extremal property. We consider the family of nonnegative homogeneous polynomials of even degree d whose sublevel set =\: g()≤ 1\ (a unit ball) has same fixed volume and want to find in this family the one that minimizes either the 1-norm or the 2-norm of its vector of coefficients. Equivalently, among all degree-d polynomials of constant 1- or 2-norm, which one minimizes the volume of its level set . We first show that in both cases this is a convex optimization problem with a unique optimal solution g*1 and g*2 respectively. We also show that g*1 is the Lp-norm polynomial Σi=1n xip, thus recovering a parsimony property of the Lp-norm via 1-norm minimization. (Indeed n= g*10 is the minimum number of non-zero coefficient for to have finite volume.) This once again illustrates the power and versatility of the 1-norm relaxation strategy in optimization when one searches for an optimal solution with parsimony properties. Next we show that g*2 is not sparse at all (and so differs from g*1) but is still a sum of p-powers of linear forms. We also characterize the unique optimal solution of the same problem where one searches for an SOS homogeneous polynomial that minimizes the trace of its associated (psd) Gram matrix, hence aiming at finding a solution which is a sum of a few squares only. Finally, we also extend these results to generalized homogeneous polynomials, which includes Lp-norms when $0

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…