On Positivity of Polynomials: The Dilation Integral Method

The focal point of this paper is the well known problem of polynomial positivity over a given domain. More specifically, we consider a multivariate polynomial f(x) with parameter vector x restricted to a hypercube X sub R n. The objective is to determine if f(x) > 0 for all x isin X. Motivated by NP-Hardness considerations, we introduce the so-called dilation integral method. Using this method, a ldquosofteningrdquo of this problem is described. That is, rather than insisting that f(x) be positive for all x isin X, we consider the notions of practical positivity and practical non-positivity. As explained in the paper, these notions involve the calculation of a quantity epsiv > 0 which serves as an upper bound on the percentage volume of violation in parameter space where f(x) les 0 . Whereas checking the polynomial positivity requirement may be computationally prohibitive, using our epsiv-softening and associated dilation integrals, computations are typically straightforward. One highlight of this paper is that we obtain a sequence of upper bounds epsivk which are shown to be ldquosharprdquo in the sense that they converge to zero whenever the positivity requirement is satisfied. Since for fixed n , computational difficulties generally increase with k, this paper also focuses on results which reduce the size of the required k in order to achieve an acceptable percentage volume certification level. For large classes of problems, as the dimension of parameter space n grows, the required k value for acceptable percentage volume violation may be quite low. In fact, it is often the case that low volumes of violation can be achieved with values as low as k=2.

[1]  N. Shor Nondifferentiable Optimization and Polynomial Problems , 1998 .

[2]  R. Tempo,et al.  Randomized Algorithms for Analysis and Control of Uncertain Systems , 2004 .

[3]  J. Garloff,et al.  Solving strict polynomial inequalities by Bernstein expansion , 1999 .

[4]  John C. Doyle Analysis of Feedback Systems with Structured Uncertainty , 1982 .

[5]  B. R. Barmish,et al.  A dilation method for robustness problems with nonlinear parameter dependence , 2003, Proceedings of the 2003 American Control Conference, 2003..

[6]  B. Barmish,et al.  On the conditioning of robustness problems , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[7]  B. Ross Barmish,et al.  New Tools for Robustness of Linear Systems , 1993 .

[8]  Pablo A. Parrilo,et al.  Semidefinite programming relaxations for semialgebraic problems , 2003, Math. Program..

[9]  Mathukumalli Vidyasagar,et al.  Learning and Generalization: With Applications to Neural Networks , 2002 .

[10]  Thomas Gerstner,et al.  Numerical integration using sparse grids , 2004, Numerical Algorithms.

[11]  Zhiping Lin,et al.  A Tutorial on GrÖbner Bases With Applications in Signals and Systems , 2008, IEEE Transactions on Circuits and Systems I: Regular Papers.

[12]  Masayuki Noro,et al.  Risa/Asir—a computer algebra system , 1992, ISSAC '92.

[13]  S.R. Ross,et al.  New Estimates for Practical Robust Negativity of Multilinear Functions , 2007, 2007 American Control Conference.

[14]  T. Apostol Mathematical Analysis , 1957 .

[15]  N. Z. Shor Class of global minimum bounds of polynomial functions , 1987 .

[16]  Hans Schönemann,et al.  SINGULAR: a computer algebra system for polynomial computations , 2001, ACCA.

[17]  John N. Tsitsiklis,et al.  A survey of computational complexity results in systems and control , 2000, Autom..

[18]  Jean B. Lasserre,et al.  Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..

[19]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[20]  A. Garulli,et al.  Positive Polynomials in Control , 2005 .

[21]  R. Cooke Real and Complex Analysis , 2011 .

[22]  Ezra Zeheb,et al.  Sign test of multivariable real polynomials , 1980 .

[23]  F. Dabbene,et al.  Exact Solution of Uncertain Convex Optimization Problems , 2007, 2007 American Control Conference.

[24]  Shankar P. Bhattacharyya,et al.  Robust Control: The Parametric Approach , 1995 .

[25]  J. Gallier Quadratic Optimization Problems , 2020, Linear Algebra and Optimization with Applications to Machine Learning.

[26]  Mathukumalli Vidyasagar,et al.  Learning And Generalization , 2002 .

[27]  Andrew Bartlett,et al.  Robust Control: Systems with Uncertain Physical Parameters , 1993 .

[28]  Knut Petras,et al.  Smolyak cubature of given polynomial degree with few nodes for increasing dimension , 2003, Numerische Mathematik.

[29]  F. Dabbene,et al.  Fast Computation of Dilation Integrals for Robustness Analysis , 2007, 2007 American Control Conference.

[30]  B. Anderson,et al.  Output feedback stabilization and related problems-solution via decision methods , 1975 .

[31]  Graziano Chesi,et al.  Solving quadratic distance problems: an LMI-based approach , 2003, IEEE Trans. Autom. Control..