Related papers: Spectral linear matrix inequalities

A linear polyomial non-negative on the non-negativity domain of finitely many linear polynomials can be expressed as their non-negative linear combination. Recently, under several additional assumptions, Helton, Klep, and McCullough…

There has recently been ample interest in the question of which sets can be represented by linear matrix inequalities (LMIs). A necessary condition is that the set is rigidly convex, and it has been conjectured that rigid convexity is also…

In this paper we establish some applications of the Scherer-Hol's theorem for polynomial matrices. Firstly, we give a representation for polynomial matrices positive definite on subsets of compact polyhedra. Then we establish a…

This paper considers matrix convex sets invariant under several types of rotations. It is known that matrix convex sets that are free semialgebraic are solution sets of Linear Matrix Inequalities (LMIs); they are called free spectrahedra.…

We study sum-of-squares representations of symmetric univariate real matrix polynomials that are positive semidefinite along the real line. We give a new proof of the fact that every positive semidefinite univariate matrix polynomial of…

Identifying the collection of scalars that represent a non-negative matrix's eigenvalues is known as the non-negative inverse eigenvalue problem (NIEP). Conditions for the existence of a non-negative matrix with a certain spectrum are…

In this paper we express the eigenvalues of anti-heptadiagonal persymmetric Hankel matrices as the zeros of explicit polynomials giving also a representation of its eigenvectors. We present also an expression depending on localizable…

We associate to a real projective variety $X$ two convex cones which are fundamental in real algebraic geometry: the cone $P_X$ of quadratic forms nonnegative on $X$, and the cone $\Sigma_X$ of sums of squares of linear forms. The dual cone…

If a real symmetric matrix of linear forms is positive definite at some point, then its determinant is a hyperbolic hypersurface. In 2007, Helton and Vinnikov proved a converse in three variables, namely that every hyperbolic plane curve…

A spectrahedron is a convex set defined by a linear matrix inequality, i.e., the set of all $x \in \mathbb{R}^g$ such that \[ L_A(x) = I + A_1 x_1 + A_2 x_2 + \dots + A_g x_g \succeq 0 \] for some symmetric matrices $A_1,\ldots,A_g$. This…

We define tensors, corresponding to cubic polynomials, which have the same exponent $\omega$ as the matrix multiplication tensor. In particular, we study the symmetrized matrix multiplication tensor $sM_n$ defined on an $n\times n$ matrix…

We introduce the notions of symmetric and symmetrizable representations of $\text{SL}_2(\mathbb{Z})$. The linear representations of $\text{SL}_2(\mathbb{Z})$ arising from modular tensor categories are symmetric and have congruence kernel.…

We solve a supersymmetric matrix model with a general potential. While matrix models usually describe surfaces, supersymmetry enforces a cancellation of bosonic and fermionic loops and only diagrams corresponding to so-called branched…

It is well known that the sum of negative (positive) eigenvalues of some finite Hermitian matrix $V$ is concave (convex) with respect to $V$. Using the theory of the spectral shift function we generalize this property to self-adjoint…

We follow a stream of the history of positive matrices and positive functionals, as applied to algebraic sums of squares decompositions, with emphasis on the interaction between classical moment problems, function theory of one or several…

For a positive linear map F and a normal matrix N, we show that |F(N)| is bounded by some simple linear combinations in the unitary orbit of F(|N|). Several elegant sharp inequalities are derived, especially for the Schur product.

A characterization of the general linear equation in standard form admitting a maximal symmetry algebra is obtained in terms of a simple set of conditions relating the coefficients of the equation. As a consequence, it is shown that in its…

A weakly infeasible semidefinite program (SDP) has no feasible solution, but it has approximate solutions whose constraint violation is arbitrarily small. These SDPs are ill-posed and numerically often unsolvable. They are also closely…

Transforming an asymmetric system into a symmetric system makes it possible to exploit the simplifying properties of symmetry in control problems. We define and characterize the family of symmetrizable systems, which can be transformed into…

This work is concerned with different aspects of spectrahedra and their projections, sets that are important in semidefinite optimization. We prove results on the limitations of so called Lasserre and theta body relaxation methods for…