815 research outputs found
Certificates of positivity in the simplicial Bernstein basis.
We study in the paper the positivity of real multivariate polynomials over a non-degenerate simplex V. We aim at obtaining certificates of positivity, {\it i.e.} algebraic identities certifying the positivity of a given polynomial on V, thus generalizing the work in \cite{BCR}. In order to do so, we use the Bernstein polynomials, which are more suitable than the usual monomial basis
Nonnegative Polynomial with no Certificate of Nonnegativity in the Simplicial Bernstein Basis
This paper presents a nonnegative polynomial that cannot be represented with
nonnegative coefficients in the simplicial Bernstein basis by subdividing the
standard simplex. The example shows that Bernstein Theorem cannot be extended
to certificates of nonnegativity for polynomials with zeros at isolated points
Certified Roundoff Error Bounds using Bernstein Expansions and Sparse Krivine-Stengle Representations
Floating point error is an inevitable drawback of embedded systems
implementation. Computing rigorous upper bounds of roundoff errors is
absolutely necessary to the validation of critical software. This problem is
even more challenging when addressing non-linear programs. In this paper, we
propose and compare two new methods based on Bernstein expansions and sparse
Krivine-Stengle representations, adapted from the field of the global
optimization to compute upper bounds of roundoff errors for programs
implementing polynomial functions. We release two related software package
FPBern and FPKiSten, and compare them with state of the art tools. We show that
these two methods achieve competitive performance, while computing accurate
upper bounds by comparison with other tools.Comment: 20 pages, 2 table
Polynomial Optimization with Applications to Stability Analysis and Control - Alternatives to Sum of Squares
In this paper, we explore the merits of various algorithms for polynomial
optimization problems, focusing on alternatives to sum of squares programming.
While we refer to advantages and disadvantages of Quantifier Elimination,
Reformulation Linear Techniques, Blossoming and Groebner basis methods, our
main focus is on algorithms defined by Polya's theorem, Bernstein's theorem and
Handelman's theorem. We first formulate polynomial optimization problems as
verifying the feasibility of semi-algebraic sets. Then, we discuss how Polya's
algorithm, Bernstein's algorithm and Handelman's algorithm reduce the
intractable problem of feasibility of semi-algebraic sets to linear and/or
semi-definite programming. We apply these algorithms to different problems in
robust stability analysis and stability of nonlinear dynamical systems. As one
contribution of this paper, we apply Polya's algorithm to the problem of
H_infinity control of systems with parametric uncertainty. Numerical examples
are provided to compare the accuracy of these algorithms with other polynomial
optimization algorithms in the literature.Comment: AIMS Journal of Discrete and Continuous Dynamical Systems - Series
- …