Related papers: Self-dual polyhedral cones and their slack matrice…
Yannakakis' theorem relating the extension complexity of a polytope to the size of a nonnegative factorization of its slack matrix is a seminal result in the study of lifts of convex sets. Inspired by this result and the importance of lifts…
A convex cone is homogeneous if its automorphism group acts transitively on the interior of the cone, i.e., for every pair of points in the interior of the cone, there exists a cone automorphism that maps one point to the other. Cones that…
A polyhedron is a graph $G$ which is simple, planar and 3-connected. In this note, we classify the family of strongly involutive self-dual polyhedra. The latter is done by using a well-known result due to Tutte characterizing 3-connected…
We consider multiplicative semigroups of real dxd matrices. A semigroup S is called Perron if each of its matrices has a Perron eigenvalue, i.e., an eigenvalue equal to the spectral radius. If all matrices of S leave a proper convex cone…
Let ${\cal S}_+^n \subset {\cal S}^n$ be the cone of positive semi-definite matrices as a subset of the vector space of real symmetric $n \times n$ matrices. The intersection of ${\cal S}_+^n$ with a linear subspace of ${\cal S}^n$ is…
Many problems of systems control theory boil down to solving polynomial equations, polynomial inequalities or polyomial differential equations. Recent advances in convex optimization and real algebraic geometry can be combined to generate…
Let A be a finite subset of N^n and R[x]_A be the space of real polynomials whose monomial powers are from A. Let K be a compact basic semialgebraic set of R^n such that R[x]_A contains a polynomial that is positive on K. Denote by P_A(K)…
An equivalence between attainability of simultaneous diagonalization (SD) and hidden convexity in quadratically constrained quadratic programming (QCQP) stimulates us to investigate necessary and sufficient SD conditions, which is one of…
In this paper we study a class of convex sets which are called closed pseudo-cones and study a new duality of this class. It turns out that the duality characterizes closed pseudo-cones and is essentially the only possible abstract duality…
We study dualities in off-shell 4D N = 2 supersymmetric sigma-models, using the projective superspace approach. These include (i) duality between the real O(2n) and polar multiplets; and (ii) polar-polar duality. We demonstrate that the…
The problem of minimizing a (nonconvex) quadratic form over the unit simplex, referred to as a standard quadratic program, admits an exact convex conic formulation over the computationally intractable cone of completely positive matrices.…
We investigate subgroups of SL (n,Z) which preserve an open nondegenerate convex cone in real n-space and admit in that cone as fundamental domain a polyhedral cone of which some faces are allowed to lie on the boundary. Examples are…
Copositive and completely positive matrices play an increasingly important role in Applied Mathematics, namely as a key concept for approximating NP-hard optimization problems. The cone of copositive matrices of a given order and the cone…
We explore the asymptotic convergence and nonasymptotic maximal inequalities of supermartingales and backward submartingales in the space of positive semidefinite matrices. These are natural matrix analogs of scalar nonnegative…
In this paper, we study a class of fractional semi-infinite polynomial programming (FSIPP) problems, in which the objective is a fraction of a convex polynomial and a concave polynomial, and the constraints consist of infinitely many convex…
We introduce and study a cone which consists of a class of generalized polynomial functions and which provides a common framework for recent non-negativity certificates of polynomials in sparse settings. Specifically, this…
Hankel spectrahedra are the dual convex cones to the cone of sums of squares of real polynomials, and we study them from the point of view of convex algebraic geometry. We show that the Zariski closure of the union of all extreme rays of…
If $X$ is an $n\times n$ symmetric matrix, then the directional derivative of $X \mapsto \det(X)$ in the direction $I$ is the elementary symmetric polynomial of degree $n-1$ in the eigenvalues of $X$. This is a polynomial in the entries of…
It is shown that projectivized irreducible components of nilpotent cones of complex symmetric spaces are projective self-dual algebraic varieties. Other properties equivalent to their projective self-duality are found.
The MaxCut SDP is one of the most well-known semidefinite programs, and it has many favorable properties. One of its nicest geometric/duality properties is the fact that the vertices of its feasible region correspond exactly to the cuts of…