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 $p$ whose sublevel set $\mathbf{G}=\{\mathbf{x}: g(\mathbf{x})\leq 1\}$ (a unit ball) has the same fixed volume and want to find in this family the polynomial that minimizes either the parsimony-inducing $\ell_1$-norm or the $\ell_2$-norm of its vector of coefficients. Equivalently, among all degree-$p$ polynomials of constant $\ell_1$- or $\ell_2$-norm, which one minimizes the volume of its level set $\mathbf{G}$? We first show that in both cases this is a convex optimization problem with a unique optimal solution $g^*_1$ or $g^*_2$, respectively. We also show that $g^*_1$ is the $L_p$-norm polynomial $\mathbf{x}\mapsto\sum_{i=1}^n x_i^{p}$, thus recovering a parsimony property of the $L_p$-norm polynomial via $\ell_1$-norm minimization. This once again illustrates the power and versatility of the $\ell_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 thus differs from $g^*_1$) but is still a sum of $p$-powers of linear forms. In fact, and surprisingly, for $p=2,4,6,8$, we show that $g^*_2=(\sum_ix_i^2)^{p/2}$, whose level set is the Euclidean (i.e., the $L_2$-norm) ball. We also characterize the unique optimal solution of the same problem where one searches for a sum of squares homogeneous polynomial that minimizes the (parsimony-inducing) nuclear norm of its associated (positive semidefinite) Gram matrix, hence aiming at finding a solution which is a sum of a few squares only. Again for $p=2,4$ the optimal solution is $(\sum_ix_i^2)^{p/2}$, whose level set is the Euclidean ball, and when $p\in\,4\mathbb{N}$, this is also true when $n$ is sufficiently large. Finally, we also extend these results to generalized homogeneous polynomials, which include $L_p$-norms when $0<p$ is rational.

Keywords

  1. convex optimization
  2. computational geometry
  3. $L_p$-balls
  4. parsimony-inducing norms

MSC codes

  1. 90C22

Get full access to this article

View all available purchase options and get full access to this article.

References

1.
R. B. Ash, Real Analysis and Probability, Academic Press, Boston, 1972.
2.
F. Bach, R. Jenatton, J. Mairal, and G. Obozinski, Optimization with sparsity-inducing penalties, Found. Trends Mach. Learn., 4 (2012), pp. 1--106.
3.
A. Beck and Y. C. Eldar, Sparsity constrained nonlinear optimization: Optimality conditions and algorithms, SIAM J. Optim., 23 (2013), pp. 1480--1509.
4.
E. Candès, J. Romberg, and T. Tao, Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information, IEEE Trans. Inform. Theory, 52 (2006), pp. 489--509.
5.
D. L. Donoho, Compressed sensing, IEEE Trans. Inform. Theory, 52 (2006), pp. 1289--1306.
6.
D. L. Donoho and M. Elad, Optimally sparse representation in general (nonorthogonal) dictionaries via $\ell^1$ minimization, Proc. Natl. Acad. Sci. USA, 100 (2003), pp. 2197--2202.
7.
E. Freitag and R. Busam, Complex Analysis, 2nd ed., Springer-Verlag, Berlin, 2009.
8.
D. Hilbert and S. Cohn-Vossen, Geometry and the Imagination, 2nd ed., Chelsea, New York, 1952.
9.
J. B. Lasserre, A quick proof for the volume of $n$-balls, Amer. Math. Monthly, 108 (2001), pp. 768--769.
10.
J. B. Lasserre, A generalization of Löwner-John's ellipsoid theorem, Math. Program., 152 (2015), pp. 559--591.
11.
J. B. Lasserre and T. Netzer, SOS approximations of nonnegative polynomials via simple high degree perturbations, Math. Z., 256 (2007), pp. 99--112.
12.
J. B. Lasserre and E. S. Zeron, Solving a class of multivariable integration problems via Laplace techniques, Appl. Math. (Warsaw), 28 (2001), pp. 391--405.
13.
A. Morozov and Sh. Shakirov, Introduction to integral discriminants, J. High Energy Phys., 12 (2009), 002.
14.
A. Yu. Morozov and Sh. R. Shakirov, New and old results in resultant theory, Theoret. and Math. Phys., 163 (2010), pp. 587--617.
15.
B. Recht, M. Fazel, and P. A. Parrilo, Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization, SIAM Rev., 52 (2010), pp. 471--501.
16.
B. Reznick, Sums of even powers of real linear forms, Mem. Amer. Math. Soc., 96 (1992), no. 463.
17.
R. T. Rockafellar, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
18.
D. V. Widder, The Laplace Transform, Princeton Math. Ser. 6, Princeton University Press, Princeton, NJ, 1941.

Information & Authors

Information

Published In

cover image SIAM Journal on Optimization
SIAM Journal on Optimization
Pages: 247 - 273
ISSN (online): 1095-7189

History

Submitted: 19 August 2014
Accepted: 1 October 2015
Published online: 26 January 2016

Keywords

  1. convex optimization
  2. computational geometry
  3. $L_p$-balls
  4. parsimony-inducing norms

MSC codes

  1. 90C22

Authors

Affiliations

Metrics & Citations

Metrics

Citations

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited By

View Options

View options

PDF

View PDF

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share on social media

The SIAM Publications Library now uses SIAM Single Sign-On for individuals. If you do not have existing SIAM credentials, create your SIAM account https://my.siam.org.