Approximating Nonnegative Polynomials via Spectral Sparsification
Abstract
We study polyhedral approximations to the cone of nonnegative polynomials. We show that any constant ratio polyhedral approximation to the cone of nonnegative degree $2d$ forms in $n$ variables has to have exponentially many facets in terms of $n$. We also show that for any fixed $m \geq 3$, all linear $m$-dimensional sections of the nonnegative cone that include $(x_1^2+x_2^2+\cdots + x_n^2)^d$ have a constant ratio polyhedral approximation with $O(n^{m-2})$ many facets. Our approach is convex geometric, and parts of the argument rely on the recent solution of the Kadison--Singer problem. We also discuss a randomized polyhedral approximation which might be of independent interest.
Keywords
MSC codes
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
A. A. Ahmadi, Lecture notes for Princeton ORFE course, Lecture 15; available at https://www.princeton.edu/~amirali/Public/Teaching/ORF523.
2.
A. Barvinok, A bound for the number of vertices of a polytope with applications, Combinatorica, 33 (2013), pp. 1--10.
3.
A. Barvinok, A Course in Convexity, Grad. Stud. Math. 54, American Mathematical Society, Providence, RI, 2002.
4.
A. Barvinok and G. Blekherman, Convex geometry of orbits, in Combinatorial and Computational Geometry, Math. Sci. Res. Inst. Publ. 52, Cambridge University Press, Cambridge, 2005, pp. 51--77.
5.
A. Barvinok, Approximating $L^{\infty}$ norms by $L^{2k}$ norms for functions on orbits, Found. Comput. Math., 2 (2002), pp. 393--412.
6.
A. Barvinok, Thrifty approximations of convex bodies by polytopes, Int. Math. Res. Not., 2014 (2014), pp. 4341--4356.
7.
A. Bhardwaj, P. Rostalski, and R. Sanyal, Deciding polyhedrality of spectrahedra, SIAM J. Optim., 25 (2015), pp. 1873--1884.
8.
G. Blekherman, Convexity properties of the cone of nonnegative polynomials, Discrete Comput. Geom., 32 (2004), pp. 345--371.
9.
G. Blekherman, P. A. Parrilo, and R. Thomas, eds., Semidefinite Optimization and Convex Algebraic Geometry, MOS-SIAM Ser. Optim. 13, SIAM, Philadelphia, PA, 2013.
10.
V. I. Bogachev, Gaussian Measures, Math. Surveys Monogr. 62, American Mathematical Society, Providence, RI, 1998.
11.
S. G. Bobkov, Remarks on the growth of Lp-norms of polynomials, Geometric Aspects of Functional Analysis, Lecture Notes in Math. 1745, Springer, Berlin, 2000.
12.
G. Braun and S. Pokutta, The matching polytope does not admit fully-polynomial size relaxation schemes, in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, PA, 2015, pp. 837--846.
13.
G. Braun, S. Fiorini, S. Pokutta, and D. Steurer, Approximation limits of linear programs (beyond hierarchies), Math. Oper. Res., 40 (2015), pp. 756--772.
14.
S. Brazitikos, A. Giannopoulos, P. Valettas, and B. Vritsiou, Geometry of Isotropic Convex Bodies, Math. Surveys Monogr. 196, American Mathematical Society, Providence, RI, 2014.
15.
O. Friedland and P. Yousef, Approximating convex bodies and matrices through Kadison--Singer, Int. Math. Res. Not. (2017), https://doi.org/10.1093/imrn/rnx206.
16.
P. M. Gruber, Minimal ellipsoids and their duals, Rend. Circ. Mat. Palermo (2), 37 (1988), pp. 35--64.
17.
M. D Choi, T. Y. Lam, and B. Reznick, Even symmetric sextics, Math. Z., 195 (1987), pp. 559--580.
18.
S. Iliman and T. De Wolff, Lower bounds for polynomials with simplex Newton polytopes based on geometric programming, SIAM J. Optim., 26 (2016), pp. 1128--1146.
19.
F. John, Extremum problems with inequalities as subsidiary conditions, in Studies and Essays Presented to R. Courant on his 60th Birthday, January 8, 1948, Interscience Publishers, New York, NY, 1948, pp. 187--204.
20.
J. Komlós, J. Pach, and G. Woeginger, Almost tight bounds for $\varepsilon$-nets, Discrete Comput. Geom., 7 (1992), pp. 163--173.
21.
A. Marcus, D. Spielman, and N. Srivastava, Interlacing families I: Bipartite Ramanujan graphs of all degrees, Ann. Math., 182 (2015), pp. 307--325.
22.
A. Marcus, D. Spielman, and N. Srivastava, Interlacing families II: Mixed characteristic polynomials and the Kadison--Singer problem, Ann. Math., 182 (2015), pp. 327--350.
23.
J. Matousek, Lectures on Discrete Geometry, Grad. Texts in Math. 212, Springer, New York, 2002.
24.
M. Naszódi, Approximating a Convex Body with a Polytope Using the Epsilon-Net Theorem, preprint, https://arxiv.org/pdf/1705.07754.pdf, 2017.
25.
P. A. Parrilo, Exploiting Algebraic Structure in Sum of Squares Programs, in Positive Polynomials in Control, D. Henrion and A. Garulli, eds., Lect. Notes Control Inf. Sci. 312, Springer, Berlin, 2005, pp. 181--194.
26.
Y. V. Prokhorov, On polynomials in normally distributed random variables, Probab. Theory Appl., 37 (1992), pp. 692--694.
27.
P. Pebay, J. M. Rojas, and D. Thompson, Optimizing $n$-variate $(n+k)$-nomials for small $k$, Theoret. Comput. Sci., 412 (2011), pp. 1457--1469.
28.
M. V. Ramana, Polyhedra, spectrahedra, and semidefinite programming, in Topics in Semidefinite and Interior-Point Methods, Fields Inst. Commun. 18, American Mathematical Society, Providence, RI, 1998, pp. 27--38.
29.
M. Rudelson, Random vectors in the isotropic position, J. Funct. Anal., 164 (1999), pp. 60--72.
30.
M. Rudelson, Contact points of convex bodies, Israel J. Math., 101 (1997), pp. 93--124.
31.
N. Srivastava, Spectral Sparsification and Restricted Invertibility, Ph.D. Dissertation, Yale University, 2010; available at https://math.berkeley.edu/~nikhil/dissertation.pdf.
32.
M. J. Todd, Minimum-Volume Ellipsoids: Theory and Algorithms, MOS-SIAM Ser. Optim. 23, SIAM, Philadelphia, PA, 2016.
33.
R. Vershynin, High-Dimensional Probability: An Introduction with Applications in Data Sciences, Camb. Ser. Stat. Probab. Math. 47, Cambridge University Press, Cambridge, 2018.
34.
R. Vershynin, Introduction to the non-asymptotic analysis of random matrices, in Compressed Sensing: Theory and Applications, Cambridge University Press, Cambridge, 2012, pp. 210--268.
Information & Authors
Information
Published In
Copyright
© 2019, Society for Industrial and Applied Mathematics.
History
Submitted: 20 March 2017
Accepted: 8 January 2019
Published online: 21 March 2019
Keywords
MSC codes
Authors
Funding Information
Einstein Stiftung Berlin https://doi.org/10.13039/501100006188
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
- Approximate Real Symmetric Tensor RankArnold Mathematical Journal, Vol. 21 | 22 August 2023