相关论文: Bianalytic free maps between spectrahedra and spec…
Linear matrix inequalities (LMIs) $I_d + \sum_{j=1}^g A_jx_j + \sum_{j=1}^g A_j^*x_j^*\succeq0$ play a role in many areas of applications and the set of solutions to one is called a spectrahedron. LMIs in (dimension--free) matrix variables…
Hermitian linear matrix pencils are ubiquitous in control theory, operator systems, semidefinite optimization, and real algebraic geometry. This survey reviews the fundamental features of the matricial solution set of a linear matrix…
The (matricial) solution set of a Linear Matrix Inequality (LMI) is a convex basic non-commutative semi-algebraic set. The main theorem of this paper is a converse, a result which has implications for both semidefinite programming and…
This paper concerns free analytic maps on noncommutative domains. These maps are free analogs of classical holomorphic functions in several complex variables, and are defined in terms of noncommuting variables amongst which there are no…
A linear matrix inequality (LMI) is a condition stating that a symmetric matrix whose entries are affine linear combinations of variables is positive semidefinite. Motivated by the fact that diagonal LMIs define polyhedra, the solution set…
Given a tuple $E=(E_1,\dots,E_g)$ of $d\times d$ matrices, the collection of those tuples of matrices $X=(X_1,\dots,X_g)$ (of the same size) such that $\| \sum E_j\otimes X_j\|\le 1$ is called a spectraball $\mathcal B_E$. Likewise, given a…
The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…
The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…
This article investigates matrix convex sets and introduces their tracial analogs which we call contractively tracial convex sets. In both contexts completely positive (cp) maps play a central role: unital cp maps in the case of matrix…
In this paper, we analyze problems involving matrix variables for which we use a noncommutative algebra setting. To be more specific, we use a class of functions (called NC analytic functions) defined by power series in noncommuting…
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…
Linear matrix Inequalities (LMIs) have had a major impact on control but formulating a problem as an LMI is an art. Recently there is the beginnings of a theory of which problems are in fact expressible as LMIs. For optimization purposes it…
Semidefinite programming is based on optimization of linear functionals over convex sets defined by linear matrix inequalities, namely, inequalities of the form $$L_A(X)=I-A_1X_1-\dots-A_g X_g\succeq0.$$ Here the $X_j$ are real numbers and…
We study holomorphic isometries between bounded symmetric domains with respect to the Bergman metrics up to a normalizing constant. In particular, we first consider a holomorphic isometry from the complex unit ball into an irreducible…
This article resides in the realm of the noncommutative (free) analog of real algebraic geometry - the study of polynomial inequalities and equations over the real numbers - with a focus on matrix convex sets $C$ and their projections $\hat…
We show that maximal $S$-free convex sets are polyhedra when $S$ is the set of integral points in some rational polyhedron of $\mathbb{R}^n$. This result extends a theorem of Lov\'asz characterizing maximal lattice-free convex sets. Our…
Let $A(x)=A\_0+x\_1A\_1+...+x\_nA\_n$ be a linear matrix, or pencil, generated by given symmetric matrices $A\_0,A\_1,...,A\_n$ of size $m$ with rational entries. The set of real vectors x such that the pencil is positive semidefinite is a…
Free spectrahedra are natural objects in the theories of operator systems and spaces and completely positive maps. They also appear in various engineering applications. In this paper, free spectrahedra satisfying a Reinhardt symmetry…
LMI (Linear Matrix Inequalities) regions is an important class of convex subsets of $\mathbb C$ arising in control theory. An LMI region $\mathfrak D$ is defined by its matrix-valued characteristic function $f_{\mathfrak D}(z) = {\mathbf L}…
We extended the study of the linear fractional self maps (e.g. by Cowen-MacCluer and Bisi-Bracci on the unit balls) to a much more general class of domains, called generalized type-I domains, which includes in particular the classical…