Related papers: A Matrix Positivstellensatz with lifting polynomia…
We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…
The concepts of differentiation and integration for matrices are known. As far as each matrix is differentiable, it is not clear a priori whether a given matrix is integrable or not. Recently some progress was obtained for diagonalizable…
Real Nullstellensatz is a classical result from Real Algebraic Geometry. It has recently been extended to quaternionic polynomials by Alon and Paran. The aim of this paper is to extend their Quaternionic Nullstellensatz to matrix…
We consider a symmetric matrix, the entries of which depend linearly on some parameters. The domains of the parameters are compact real intervals. We investigate the problem of checking whether for each (or some) setting of the parameters,…
The question of how to certify the non-negativity of a polynomial function lies at the heart of Real Algebra and it also has important applications to Optimization. In the setting of symmetric polynomials Timofte provided a useful way of…
A linear map between real symmetric matrix spaces is positive if all positive semidefinite matrices are mapped to positive semidefinite ones. A real symmetric matrix is separable if it can be written as a summation of Kronecker products of…
A real square matrix is algebraically positive if there exists a real polynomial $f$ such that $f(A)$ is a positive matrix. In this paper, we give a sufficient condition for a sign pattern matrix to allow algebraic positivity, and give some…
Recently, the conditional SAGE certificate has been proposed as a sufficient condition for signomial positivity over a convex set. In this article, we show that the conditional SAGE certificate is $\textit{complete}$. That is, for any…
We review several (and provide new) results on the theory of moments, sums of squares and basic semi-algebraic sets when convexity is present. In particular, we show that under convexity, the hierarchy of semidefinite relaxations for…
This paper investigates the minimization of the expectation of piecewise polynomial loss functions over Wasserstein balls. This optimization problem often appears as a key sub-problem of distributionally robust optimization problems. We…
Several signal recovery tasks can be relaxed into semidefinite programs with rank-one minimizers. A common technique for proving these programs succeed is to construct a dual certificate. Unfortunately, dual certificates may not exist under…
We propose and discuss how basic notions (quadratic modules, positive elements, semialgebraic sets, Archimedean orderings) and results (Positivstellensaetze) from real algebraic geometry can be generalized to noncommutative $*$-algebras. A…
Real algebraic geometry provides certificates for the positivity of polynomials on semi-algebraic sets by expressing them as a suitable combination of sums of squares and the defining inequalitites. We show how Putinar's theorem for…
We show that Connes' embedding conjecture on von Neumann algebras is equivalent to the existence of certain algebraic certificates for a polynomial in noncommuting variables to satisfy the following nonnegativity condition: The trace is…
It is shown that the polynomial \[p(t) = \text{Tr}[(A+tB)^m]\] has positive coefficients when $m = 6$ and $A$ and $B$ are any two 3-by-3 complex Hermitian positive definite matrices. This case is the first that is not covered by prior,…
Given a positive noncommutative polynomial $f$, equivalently a sum of Hermitian squares (SOHS), there exists a positive semidefinite Gram matrix that encrypts all the structural essence of $f$. There are no available methods for extending a…
Consider a convex set S defined by a matrix inequality of polynomials or rational functions over a domain. The set S is called semidefinite programming (SDP) representable or just semidefinite representable if it equals the projection of a…
We extend Krivine's strict positivstellensatz for usual (real multivariate) polynomials to symmetric matrix polynomials with scalar constraints. The proof is an elementary computation with Schur complements. Analogous extensions of Schm\"…
This paper is concerned with the factorization and equivalence problems of multivariate polynomial matrices. We present some new criteria for the existence of matrix factorizations for a class of multivariate polynomial matrices, and obtain…
Positive semidefinite Hermitian matrices that are not fully specified can be completed provided their underlying graph is chordal. If the matrix is positive definite the completion can be uniquely characterized as the matrix that maximizes…