Convexity Properties of the Cone of Nonnegative Polynomials
نویسنده
چکیده
We study metric properties of the cone of homogeneous non-negative multivariate polynomials and the cone of sums of powers of linear forms, and the relationship between the two cones. We compute the maximum volume ellipsoid of the natural base of the cone of nonnegative polynomials and the minimum volume ellipsoid of the natural base of the cone of powers of linear forms and compute the coefficients of symmetry of the bases. The multiplication by (x1 + . . . + x 2 n) m induces an isometric embedding of the space of polynomials of degree 2k into the space of polynomials of degree 2(k + m), which allows us to compare the cone of non-negative polynomials of degree 2k and the cone of sums of 2(k + m)-powers of linear forms. We estimate the volume ratio of the bases of the two cones and the rate at which it approaches 1 as m grows.
منابع مشابه
Dimensional Differences between Nonnegative Polynomials and Sums of Squares
We study dimensions of the faces of the cone of nonnegative polynomials and the cone of sums of squares; we show that there are dimensional differences between corresponding faces of these cones. These dimensional gaps occur in all cases where there exist nonnegative polynomials that are not sums of squares. As either the degree or the number of variables grows the gaps become very large, asymp...
متن کاملA Cutting Plane Method for Solving Convex Optimization Problems over the Cone of Nonnegative Polynomials
Many practical problems can be formulated as convex optimization problems over the cone of nonnegative univariate polynomials. We use a cutting plane method for solving this type of optimization problems in primal form. Therefore, we must be able to verify whether a polynomial is nonnegative, i.e. if it does not have real roots or all real roots are multiple of even order. In this paper an effi...
متن کاملPolynomials than Sums of Squares
We investigate the quantitative relationship between nonnegative polynomials and sums of squares of polynomials. We show that if the degree is fixed and the number of variables grows then there are significantly more nonnegative polynomials than sums of squares. More specifically, we take compact bases of the cone of nonnegative polynomials and the cone of sums of squares and derive bounds for ...
متن کاملSemidefinite and Second Order Cone Programming Seminar Fall 2012 Lecture 10 Instructor : Farid Alizadeh Scribe
1 Overview In this lecture, we show that a number of sets and functions related to the notion of sum-of-squares (SOS) are SD-representable. We will start with positive polynomials. Then, we introduce a general algebraic framework in which the notion of sum-of-squares can be formulated in very general setting. Recall the cone of nonnegative univariate polynomials: P 2d [t] = p(t) = p 0 + p 1 t +...
متن کاملOn Cones of Nonnegative Quartic Forms
Historically, much of the theory and practice in nonlinear optimization has revolved around the quadratic models. Though quadratic functions are nonlinear polynomials, they are well structured and easy to deal with. Limitations of the quadratics, however, become increasingly binding as higher degree nonlinearity is imperative in modern applications of optimization. In the recent years, one obse...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 32 شماره
صفحات -
تاریخ انتشار 2004