Related papers: Operator systems and convex sets with many normal …
We extend the $\lambda$-theory of operator spaces given by Defant and Wiesner (2014), that generalizes the notion of the projective, Haagerup and Schur tensor norm for operator spaces to matrix ordered spaces and Banach $*$-algebras. Given…
A closed convex subset of a normed linear space is said to have the strong separation property if it can be strongly separated from every other disjoint closed and convex set by a closed hyperplane. In this paper we give some results on the…
This survey reviews a clustering method based on solving a convex optimization problem. Despite the plethora of existing clustering methods, convex clustering has several uncommon features that distinguish it from prior art. The…
Various characterizations of finite convex geometries are well known. This note provides similar characterizations for possibly infinite convex geometries whose lattice of closed sets is strongly coatomic and lower continuous. Some classes…
Algebraic properties of $n$-place opening operations on a fixed set are described. Conditions under which a Menger algebra of rank $n$ can be represented by $n$-place opening operations are found.
The geometric mean of two matrices is considered and analyzed from a computational viewpoint. Some useful theoretical properties are derived and an analysis of the conditioning is performed. Several numerical algorithms based on different…
Let S_k be the set of separable states on B(C^m \otimes C^n) admitting a representation as a convex combination of k pure product states, or fewer. If m>1, n> 1, and k \le max(m,n), we show that S_k admits a subset V_k such that V_k is…
As science and engineering have become increasingly data-driven, the role of optimization has expanded to touch almost every stage of the data analysis pipeline, from signal and data acquisition to modeling and prediction. The optimization…
Let $\mathcal{B}(H)$ be the bounded, linear operators on a separable Hilbert space equipped with the norm topology. A property is called typical if the set of operators fulfilling the property is co-meager. We show that having non-empty…
Relations between some kinds of formal and standard smoothness, for morphisms of schemes, are clarified in surprisingly simple and direct ways, bypassing much of the customarily employed machinery. Even the deep local-to-global property of…
A theorem of Mandel allows to determine the covector set of an oriented matroid from its set of topes by using the composition condition. We provide a generalization of that result, stating that the covector set of a conditional oriented…
The usual Laurent expansion of the analytic tensors on the complex plane is generalized to any closed and orientable Riemann surface represented as an affine algebraic curve. As an application, the operator formalism for the $b-c$ systems…
Any maximal monotone operator can be characterized by a convex function. The family of such convex functions is invariant under a transformation connected with the Fenchel-Legendre conjugation. We prove that there exist a convex…
Let $D$ be a space of $2\times n$ matrices. Then the face of the cone of all completely positive maps from $M_2$ into $M_n$ given by $D$ is an exposed face of the bigger cone of all decomposable positive linear maps if and only if the set…
In his seminal 1983 paper, Jim Lawrence introduced lopsided sets and featured them as asymmetric counterparts of oriented matroids, both sharing the key property of strong elimination. Moreover, symmetry of faces holds in both structures as…
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…
In the geometric approach to define complexity, operator complexity is defined as the distance on the operator space. In this paper, based on the analogy with the circuit complexity, the operator size is adopted as the metric of the…
Convex sets appear in various mathematical theories, and are used to define notions such as convex functions and hulls. As an abstraction from the usual definition of convex sets in vector spaces, we formalize in Coq an intrinsic…
A convex optimization problem in conic form involves minimizing a linear functional over the intersection of a convex cone and an affine subspace. In some cases, it is possible to replace a conic formulation using a certain cone, with a…
In many cases the convexity of the image of a linear map with range is $R^n$ is automatic because of the facial structure of the domain of the map. We develop a four step procedure for proving this kind of ``automatic convexity''. To make…