相关论文: On equivalent representations and properties of fa…

There are three types of results in this paper. The first, extending a representation theorem on a conformal mapping that omits two values of equal modulus. This was due to Brickman and Wilken. They constructed a representation as a convex…

Optimizing an implicational base of a closure system consists in turning this implicational base into an equivalent one with premises and conclusions as small as possible. This task is known to be hard in general but tractable for a number…

Semidefinite programming (SDP) is the task of optimizing a linear function over the common solution set of finitely many linear matrix inequalities (LMIs). For the running time of SDP solvers, the maximal matrix size of these LMIs is…

We show that there is an isometry between the real ambient space of all Mueller matrices and the space of all Hermitian matrices which maps the Mueller matrices onto the positive semidefinite matrices. We use this to establish an optimality…

In this paper, we prove the integrality conjecture for quotient stacks arising from weakly symmetric representations of reductive groups. Our main result is a decomposition of the cohomology of the stack into finite-dimensional components…

We classify irreducible representations of connected compact Lie groups whose orbit space is isometric to the orbit space of a representation of a finite extension of (positive dimensional) toric group. They turn out to be exactly the…

The projection onto the intersection of sets generally does not allow for a closed form even when the individual projection operators have explicit descriptions. In this work, we systematically analyze the projection onto the intersection…

The approximate representation of operators by finite matrices is analysed in terms of accuracy and convergence. The identity operator, for example, can be reconstructed using a basis of harmonic oscillator states leading to a narrow peak…

The state space of an operator system of $n$-by-$n$ matrices has, in a sense, many normal cones. Merely this convex geometrical property implies smoothness qualities and a clustering property of exposed faces. The latter holds since each…

The conic structure of the convex cone of non-negative operator convex functions on $(0,\infty)$ (also on $(-1,1)$) is clarified. We completely determine the extreme rays, the closed faces, and the simplicial closed faces of this convex…

We survey a variety of results about partially isometric matrices. We focus primarily on results that are distinctly finite-dimensional. For example, we cover a recent solution to the similarity problem for partial isometries. We also…

In this note we characterize isoperimetric regions inside almost-convex cones. More precisely, as in the case of convex cones, we show that isoperimetric sets are given by intersecting the cone with a ball centered at the origin.

We study multivariate normal models that are described by linear constraints on the inverse of the covariance matrix. Maximum likelihood estimation for such models leads to the problem of maximizing the determinant function over a…

In this paper we give a review of the method of imsets introduced by Studeny (2005) from a geometric point of view. Elementary imsets span a polyhedral cone and its dual cone is the cone of supermodular functions. We review basic facts on…

We characterize the mixed discriminant of positive semi definite matrices using its most basic properties. As a corollary we establish its minimality among non negative and multi additive functionals.

Robinson introduced a quotient space of pairs of convex sets which share their recession cone. In this paper minimal pairs of unbounded convex sets, i.e. minimal representations of elements of Robinson's spaces are investigated. The fact…

This note provides another proof for the {\em convexity} ({\em strict convexity}) of $\log \det ( I + KX^{-1} )$ over the positive definite cone for any given positive semidefinite matrix $K \succeq 0$ (positive definite matrix $K \succ 0$)…

Kostka coefficients appear in the representation theory of the general linear group and enumerate semistandard Young tableaux of fixed shape and content. The $r$-Kostka cone is the real polyhedral cone generated by pairs of partitions with…

Many problems of systems control theory boil down to solving polynomial equations, polynomial inequalities or polyomial differential equations. Recent advances in convex optimization and real algebraic geometry can be combined to generate…

We introduce a convex optimization modeling framework that transforms a convex optimization problem expressed in a form natural and convenient for the user into an equivalent cone program in a way that preserves fast linear transforms in…