• Corpus ID: 55928573

Dualities in Convex Algebraic Geometry

  title={Dualities in Convex Algebraic Geometry},
  author={Philipp Rostalski and Bernd Sturmfels},
  journal={arXiv: Optimization and Control},
Convex algebraic geometry concerns the interplay between optimization theory and real algebraic geometry. Its objects of study include convex semialgebraic sets that arise in semidefinite programming and from sums of squares. This article compares three notions of duality that are relevant in these contexts: duality of convex bodies, duality of projective varieties, and the Karush-Kuhn-Tucker conditions derived from Lagrange duality. We show that the optimal value of a polynomial program is an… 
Algebraic boundaries of convex semi-algebraic sets
AbstractWe study the algebraic boundary of a convex semi-algebraic set via duality in convex and algebraic geometry. We generalise the correspondence of facets of a polytope with the vertices of the
Real Algebraic Geometry in Convex Optimization
Author(s): Vinzant, Cynthia Leslie | Advisor(s): Sturmfels, Bernd | Abstract: In the past twenty years, a strong interplay has developed between convex optimization and algebraic geometry. Algebraic
The Geometry of Discotopes
. We study a class of semialgebraic convex bodies called discotopes. These are instances of zonoids, objects of interest in real algebraic geometry and random geometry. We focus on the face structure
Semidefinite representations of non-compact convex sets
We consider the problem of the semidefinite representation of a class of non-compact basic semialgebraic sets. We introduce the conditions of pointedness and closedness at infinity of a semialgebraic
Optimizing a linear function over a noncompact real algebraic variety
This paper proves that the conclusion that the optimal value function Φ is represented by the defining equation of the hypersurface dual to the projective closure of X is still true for a noncompact real algebraic variety X, when X is irreducible, smooth and the recession cone of the closure of the convex hull co (X) ofX is pointed.
Algebraic boundaries of Hilbert’s SOS cones
Abstract We study the geometry underlying the difference between non-negative polynomials and sums of squares (SOS). The hypersurfaces that discriminate these two cones for ternary sextics and
Optimizing a Parametric Linear Function over a Non-compact Real Algebraic Variety
The goal is to compute a representing polynomial which defines a hypersurface containing the graph of the optimal value function, and an algorithm for solving the considered parametric optimization problem for generic parameters' values.
Projective duals to algebraic and tropical hypersurfaces
We study a tropical analogue of the projective dual variety of a hypersurface. When X is a curve in P2 or a surface in P3 , we provide an explicit description of Trop(X∗) in terms of Trop(X) , as
Quantum Convex Support
Semidefinite Representations of Noncompact Convex Sets
The conditions of pointedness and closedness at infinity of a semialgebraic set are introduced and it is shown that under these conditions the authors' modified hierarchies of nested theta bodies and Lasserre's relaxations converge to the closure of the convex hull of $S$.


A double look at duality
The two forms of duality that are encountered most frequently by the systems theorist-linear duality and convex duality-are examined. Linear duality has a strong algebraic characterization which
The algebraic degree of semidefinite programming
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of
Some geometric results in semidefinite programming
The notion of an algebraic polar of a spectrahedron is introduced, and its relation to the usual geometric polar is presented, and this is shown to yield characterizations for extreme points and extreme rays ofSpectrahedra.
Positive Polynomials and Projections of Spectrahedra
A Positivstellensatz for projections of spectrahedra is proved, which exceeds the known results that only work for basic closed semialgebraic sets.
Semidefinite Programming
A survey of the theory and applications of semidefinite programs and an introduction to primaldual interior-point methods for their solution are given.
Theta Bodies for Polynomial Ideals
A hierarchy of nested semidefinite relaxations of the convex hull of real solutions to an arbitrary polynomial ideal called theta bodies of the ideal is introduced and a geometric description of the first theta body for all ideals is given.
Convex hulls of curves of genus one
Algorithms in real algebraic geometry
This chapter discusses computing roadmaps and Connected Components of Algebraic Sets, as well as the "complexity of Basic Algorithms" and "cylindrical Decomposition Algorithm".
Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals
An algorithm is proposed, using numerical linear algebra and semidefinite optimization techniques, to compute all (finitely many) points of the real variety Vℝ(I) as well as a set of generators of theReal radical ideal, obtained in the form of a border or Gröbner basis.
Global Optimization with Polynomials and the Problem of Moments
It is shown that the problem of finding the unconstrained global minimum of a real-valued polynomial p(x): R n to R, in a compact set K defined byPolynomial inequalities reduces to solving an (often finite) sequence of convex linear matrix inequality (LMI) problems.