New Dependencies of Hierarchies in Polynomial Optimization

We compare four key hierarchies for solving Constrained Polynomial Optimization Problems (CPOP): Sum of Squares (SOS), Sum of Diagonally Dominant Polynomials (SDSOS), Sum of Nonnegative Circuits (SONC), and the Sherali Adams (SA) hierarchies. We prove a collection of dependencies among these hierarchies both for general CPOPs and for optimization problems on the Boolean hypercube. Key results include for the general case that the SONC and SOS hierarchy are polynomially incomparable, while SDSOS is contained in SONC. A direct consequence is the non-existence of a Putinar-like Positivstellensatz for SDSOS. On the Boolean hypercube, we show as a main result that Schm\"udgen-like versions of the hierarchies SDSOS*, SONC*, and SA* are polynomially equivalent. Moreover, we show that SA* is contained in any Schm\"udgen-like hierarchy that provides a O(n) degree bound.Comment: 26 pages, 4 figure

Handelman 's hierarchy for the maximum stable set problem.

The maximum stable set problem is a well-known NP-hard problem in combinatorial optimization, which can be formulated as the maximization of a quadratic square-free polynomial over the (Boolean) hypercube. We investigate a hierarchy of linear programming relaxations for this problem, based on a result of Handelman showing that a positive polynomial over a polytope with non-empty interior can be represented as conic combination of products of the linear constraints defining the polytope. We relate the rank of Handelman's hierarchy with structural properties of graphs. In particular we show a relation to fractional clique covers which we use to upper bound the Handelman rank for perfect graphs and determine its exact value in the vertex-transitive case. Moreover we show two upper bounds on the Handelman rank in terms of the (fractional) stability number of the graph and compute the Handelman rank for several classes of graphs including odd cycles and wheels and their complements. We also point out links to several other linear and semidefinite programming hierarchies

Geometrical Study of the Cone of Sums of Squares plus Sums of Nonnegative Circuits

In this article, we combine sums of squares (SOS) and sums of nonnegative circuit (SONC) forms, two independent nonnegativity certificates for real homogeneous polynomials. We consider the convex cone SOS+SONC of forms that decompose into a sum of an SOS and a SONC form and study it from a geometric point of view. We show that the SOS+SONC cone is proper and neither closed under multiplications nor under linear transformation of variables. Moreover, we present an alternative proof of an analog of Hilbert's 1888 Theorem for the SOS+SONC cone and prove that in the non-Hilbert cases it provides a proper superset of both the SOS and the SONC cone. This follows by exploiting a new necessary condition for membership in the SONC cone

The Complexity of Some Geometric Proof Systems

In this Thesis we investigate proof systems based on Integer Linear Programming. These methods inspect the solution space of an unsatisfiable propositional formula and prove that this space contains no integral points. We begin by proving some size and depth lower bounds for a recent proof system, Stabbing Planes, and along the way introduce some novel methods for doing so. We then turn to the complexity of propositional contradictions generated uniformly from first order sentences, in Stabbing Planes and Sum-Of-Squares. We finish by investigating the complexity-theoretic impact of the choice of method of generating these propositional contradictions in Sherali-Adams

Über die Maximal Mediated Set Struktur und die Anwendungen Nichtnegativer Circuit Polynome

Certifying the nonnegativity of a polynomial is a significant task both for mathematical and for scientific applications. In general, showing the nonnegativity of a random polynomial is hard. However, for certain classes of polynomials one can find easier conditions that imply their nonnegativity. In this work we investigate both the theoretic and the applied aspects of a special class of polynomials called circuit polynomials. On the theoretical side, we study the relationship of this class of polynomials with another very well studied class called sums of squares using the notion of the maximal mediated set (MMS). We show that MMS is a property of an equivalence class, rather than a property of a single circuit polynomial. With this in mind, we generate a large database of MMS using the software Polymake, and present some statistical and computational observations. On the applied side, we address to the problem of multistationarity in the chemical reaction networks theory by employing a symbolic nonnegativity certification technique via circuit polynomials. The existence of multiple stationary states for a given reaction network with a given starting point is important, as this is closely related to cellular communication in the context of biochemical reaction networks. The existence of multistationarity can be decided by studying the signs of a relevant polynomial whose coefficients are parameterized by the reaction rates. As a case study, we consider the (de)phosphorylation cycle, and use the theory of nonnegative circuit polynomials in order to find a symbolic nonnegativity certificates for the aforementioned polynomial. We provide a method that describes a non-empty open region in the parameter space that enables multistationarity for the (de)phosphorylation cycle. Moreover, we provide an explicit description of such an open region for 2 and 3-site cases.Der Nachweis der Nichtnegativität eines Polynoms ist eine wichtige Aufgabe sowohl für mathematische als auch für wissenschaftliche Anwendungen. Im Allgemeinen ist es schwierig, die Nichtnegativität eines Zufallspolynoms zu zeigen. Für bestimmte Klassen von Polynomen kann man jedoch einfachere Bedingungen finden, die ihre Nichtnegativität implizieren. In dieser Arbeit untersuchen wir sowohl die theoretischen als auch die angewandten Aspekte einer speziellen Klasse von Polynomen, die als circuit Polynome bezeichnet werden. Auf der theoretischen Seite untersuchen wir die Beziehung dieser Klasse von Polynomen mit einer anderen sehr gut untersuchten Klasse namens sums of squares unter Verwendung des Begriffs der maximal mediated set (MMS). Wir zeigen, dass MMS eher eine Eigenschaft einer Äquivalenzklasse als eine Eigenschaft eines circuit polynom ist. Vor diesem Hintergrund erstellen wir mit der Polymake-Software eine große MMS-Datenbank und präsentieren einige statistische und rechnerische Beobachtungen. Auf der angewandten Seite adressieren wir das Problem der Multistationarität in der Theorie chemischer Reaktionsnetzwerke durch die Anwendung einer symbolischen Nichtnegativitäts-Zertifizierungstechnik über circuit Polynome. Die Existenz mehrerer stationärer Zustände für ein gegebenes Reaktionsnetzwerk mit einem gegebenen Startpunkt ist wichtig, da dies eng mit der zellulären Kommunikation im Kontext biochemischer Reaktionsnetzwerke zusammenhängt. Die Existenz von Multistationarität kann durch Studium der Vorzeichen eines relevanten Polynoms entschieden werden, dessen Koeffizienten durch die Reaktionsgeschwindigkeiten parametrisiert werden. Betrachten Sie als Fallbeispiel den (De)Phosphorylierungszyklus und verwenden Sie die Theorie der circuit Polynome, um ein symbolisches Nichtnegativitätszertifikat für das obige Polynom zu finden. Darüber hinaus bieten wir eine explizite Beschreibung einer solchen offenen Region für 2- und 3-Site-Fälle