相关论文: An introduction to matrix convex sets and free spe…

Subsets of the set of $g$-tuples of matrices that are closed with respect to direct sums and compact in the free topology are characterized. They are, in a dilation theoretic sense, contained in the hull of a single point.

The concept of a visible point of a convex set relative to a given point is introduced. A number of basic properties of such visible point sets is developed. In particular, it is shown that this concept is useful in the study of best…

We study the spectrum of the Finsler--Laplace operator for regular Hilbert geometries, defined by convex sets with $C^2$ boundaries. We show that for an $n$-dimensional geometry, the spectral gap is bounded above by $(n-1)^2/4$, which we…

We improve the bound on K\"uhnel's problem to determine the smallest $n$ such that the $k$-skeleton of an $n$-simplex $\Delta_n^{(k)}$ does not embed into a compact PL $2k$-manifold $M$ by showing that if $\Delta_n^{(k)}$ embeds into $M$,…

In this paper, we introduce the notion of $\alpha$--contractive mapping of Meir--Keeler type in complete metric spaces and prove new theorems which assure the existence, uniqueness and iterative approximation of the fixed point for this…

This is the first of a two part paper investigating the geometry of the integrator reach sets, and the applications thereof. In this Part I, assuming box-valued input uncertainties, we establish that this compact convex reach set is…

In this paper we derive sequences of Gershgorin-type inclusion sets for the spectra and pseudospectra of finite matrices. In common with previous generalisations of the classical Gershgorin bound for the spectrum, our inclusion sets are…

Inspired in the theorem of Krein-Milamn, we investigate the existence of extreme points in compact convex subsets of asymmetric normed spaces. We focus our attention in the finite dimensional case, giving a geometric description of all…

A spectrahedron is a set defined by a linear matrix inequality. Given a spectrahedron we are interested in the question of the smallest possible size $r$ of the matrices in the description by linear matrix inequalities. We show that for the…

We introduce the notion of trace convexity for functions and respectively, for subsets of a compact topological space. This notion generalizes both classical convexity of vector spaces, as well as Choquet convexity for compact metric…

We study the convex hull of $SO(n)$, thought of as the set of $n\times n$ orthogonal matrices with unit determinant, from the point of view of semidefinite programming. We show that the convex hull of $SO(n)$ is doubly spectrahedral, i.e.…

We describe several algorithms for matrix completion and matrix approximation when only some of its entries are known. The approximation constraint can be any whose approximated solution is known for the full matrix. For low rank…

We introduce the notion of Krein-operator convexity in the setting of Krein spaces. We present an indefinite version of the Jensen operator inequality on Krein spaces by showing that if $(\mathscr{H},J)$ is a Krein space, $\mathcal{U}$ is…

The main result of this paper is a convexity theorem for momentum mappings of certain hamiltonian actions of noncompact semisimple Lie groups. The image is required to fall within a certain open subset D of the (dual of the) Lie algebra,…

We propose a theory for matrix completion that goes beyond the low-rank structure commonly considered in the literature and applies to general matrices of low description complexity. Specifically, complexity of the sets of matrices…

The Krein-Milman theorem (1940) states that every convex compact subset of a Hausdorfflocally convex topological space, is the closed convex hull of its extreme points. In 1963, Ky Fan extended the Krein-Milman theorem to the general…

This short but self-contained survey presents a number of elegant matrix/operator inequalities for general convex or concave functions, obtained with a unitary orbit technique. Jensen, sub or super-additivity type inequalities are…

We develop tractable convex relaxations for rank-constrained quadratic optimization problems over $n \times m$ matrices, a setting for which tractable relaxations are typically only available when the objective or constraints admit spectral…

The aim of this paper is to show how free probability theory sheds light on spectral properties of deformed matricial models and provides a unified understanding of various asymptotic phenomena such as spectral measure description,…

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…