Related papers: Free Semidefinite Representation of Matrix Power F…

Let $X$ be a nilpotent space such that there exists $p\geq 1$ with $H^p(X,\mathbb Q) \ne 0$ and $H^n(X,\mathbb Q)=0$ if $n>p$. Let $Y$ be a m-connected space with $m\geq p+1$ and $H^*(Y,\mathbb Q)$ is finitely generated as algebra. We…

It is known that a real function $f$ is convex if and only if the set $$\mathrm{E}(f)=\{(x,y)\in\mathbb{R}\times\mathbb{R};\ f(x)\leq y\},$$ the epigraph of $f$ is a convex set in $\mathbb{R}^2$. We state an extension of this result for…

A graph G(V, E) is word-representable if there exists a word w over V such that distinct letters x and y alternate in w iff $xy \in E$. We introduce p-complete squares and p-complete square-free word-representable graphs. A word is…

We consider the factorization of a rectangular matrix $X $ into a positive linear combination of rank-one factors of the form $u v^\top$, where $u$ and $v$ belongs to certain sets $\mathcal{U}$ and $\mathcal{V}$, that may encode specific…

We prove an analogous Hanner's Inequality of $L^p$ spaces for positive semidefinite matrices. Let $||X||_p=\text{Tr}[(X^\ast X)^{p/2}]^{1/p}$ denote the $p$-Schatten norm of a matrix $X\in M_{n\times n}(\mathbb{C})$. We show that the…

A landmark result from rational approximation theory states that $x^{1/p}$ on $[0,1]$ can be approximated by a type-$(n,n)$ rational function with root-exponential accuracy. Motivated by the recursive optimality property of Zolotarev…

In this paper, we obtain subdifferential representation of a proper $w^*$-lower semicontinous convex function on $X^*$ as follows: Let $g$ be a proper convex $w^*$-lower semicontinuous function on $X^*$. Assume that int dom $g$…

This note focuses on the problem of representing convex sets as projections of the cone of positive semidefinite matrices, in the particular case of sets generated by bivariate polynomials of degree four. Conditions are given for the convex…

Let $D$ be a convex subset of a real vector space. It is shown that a radially lower semicontinuous function $f: D\to \mathbf{R}\cup \{+\infty\}$ is convex if and only if for all $x,y \in D$ there exists $\alpha=\alpha(x,y) \in (0,1)$ such…

Let X be a finite set of points in R^n. A polynomial p nonnegative on X can be written as a sum of squares of rational functions modulo the vanishing ideal I(X). From the point of view of applications, such as polynomial optimization, we…

For a graph $G$ with $p$ vertices the closed convex cone $\mathbb{S}^p_{\succeq0}(G)$ consists of all real positive semidefinite $p\times p$ matrices with zeros in the off-diagonal entries corresponding to nonedges of $G$. The extremal rays…

Positive definite matrices abound in a dazzling variety of applications. This ubiquity can be in part attributed to their rich geometric structure: positive definite matrices form a self-dual convex cone whose strict interior is a…

Motivated by recent advances in solution methods for mixed-integer convex optimization (MICP), we study the fundamental and open question of which sets can be represented exactly as feasible regions of MICP problems. We establish several…

We give two different definitions of what it means for a matrix-valued function to be log concave, guided by similar notions in complex differential geometry. After discussing a few simple examples, we proceed to develop some of the basic…

Let $D$ be a space of $2\times n$ matrices. Then the face of the cone of all completely positive maps from $M_2$ into $M_n$ given by $D$ is an exposed face of the bigger cone of all decomposable positive linear maps if and only if the set…

Let $D$ be a strictly pseudoconvex domain in $\C^N$ and $X$ a pure-dimensional non-reduced subvariety that behaves well at $\partial D$. We provide $L^p$-estimates of extensions of holomorphic functions defined on $X$.

One of the main applications of semidefinite programming lies in linear systems and control theory. Many problems in this subject, certainly the textbook classics, have matrices as variables, and the formulas naturally contain…

Let a and x denote tuples of (jointly) freely noncommuting variables. A square matrix valued polynomial p in these variables is naturally evaluated at a tuple (A,X) of symmetric matrices with the result p(A,X) a square matrix. The…

A central question in optimization is to maximize (or minimize) a linear function over a given polytope P. To solve such a problem in practice one needs a concise description of the polytope P. In this paper we are interested in…

Given a nonnegative matrix M with rational entries, we consider two quantities: the usual positive semidefinite (psd) rank, where the matrix is factored through the cone of real symmetric psd matrices, and the rational-restricted psd rank,…