Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 9 of 9 for “"Nonnegative polynomials"”.
-
Convex Geometry in Projection Methods and the Cone of Sums of Nonnegative Circuit Polynomials
… study projection methods and the cone of sums of nonnegative circuit (SONC) polynomials. Projection methods form an efficient class of algorithms for solving feasibility problems in convex optimization, while the SONC cone is gaining importance in polynomial optimization. In the first part of the …
-
Polynomial Optimization and the Moment Problem
… number $r$ such that f-r is a sum of squares of polynomials. But current implementations of SDP are not able to minimize polynomials in rather small number of variables (>6) of degree >8. We make use of a result due to Hurwitz, to give a criterion in terms of coefficients of a polynomial to be a …
-
Volumes of certain loci of polynomials and their applicatoins
To prove that a polynomial is nonnegative on Rn, one can try to show that it is a sum of squares of polynomials (SOS). The latter problem is now known to be reducible to a semi-definite programming (SDP) computation that is much faster than classical algebraic methods, thus enabling new speed-ups …
-
Grothendieck Semirings and Definable Endofunctions
… division ring, is isomorphic to the semiring of nonnegative polynomials over the integers. A natural ordering on the semiring is related to an interesting property that definable endofunctions can have, namely, being surjective if and only if being injective. This property holds, in particular, …
-
On constrained Markov-Nikolskii and Bernstein type inequalities
… of classical Markov's problem for monotone polynomials. More precisely, if ∆n denotes the set of all monotone polynomials on [-1,1] of degree n, then for Pn ϵ ∆n and x ϵ [-1,1] the following sharp inequalities hold: │P’n(x)│≤ 2 max(Sk(-x),Sk(-x))║Pn║, for n = 2k + 2, k ≥ 0, and │P'n(x)│ ≤ 2 …
-
Symmetric nonnegative forms and sums of squares: mean roads to infinity
We compare the cones of symmetric nonnegative polynomials and symmetric sums of squares when the number of variables goes to infinity. We focus on the case of homogeneous polynomials (forms) of fixed even degree in an increasing number of variables. There are different ways of going to infinity but …
-
The Bounded-SOS+SONC Relaxation: Theory, Convergence Analysis, and Implementation
… of global optimization problems defined by real polynomials, with applications in power systems, portfolio optimization and control theory. At the heart of polynomial optimization lies the problem of certifying the global nonnegativity of polynomials. Algebraic techniques have therefore become …
-
Polynomial optimization: structures, algorithms, and engineering applications
… Specifically, we first study the class of nonnegative polynomials. Six fundamentally important types of nonnegative quartic functions coagulating into a chain in decreasing order will be presented. This structure is useful in understanding the nature of quartic polynomials. We further …
-
Sparsity, Randomness and Convexity in Applied Algebraic Geometry
… problem is to study the ratio of sums of squares polynomials inside the set of nonnegative polynomials. Our focus is on the effect of fixed monomial structure to the ratio of these two sets. We study this problem quantitatively by combining convex geometry and algebra. Some of our methods work for …