Related papers: Decomposing nuclear maps

Low-rank matrix recovery from structured measurements has been a topic of intense study in the last decade and many important problems like matrix completion and blind deconvolution have been formulated in this framework. An important…

In the present paper, the order of convexity of z\Gauss(a,b;c;z) is first given under some conditions on the positive real parameters a, b and c. Then we show that the image domains of the unit disc \D under some shifted zero-balanced…

Suppose a map $\phi$ on the set of positive definite matrices satisfies $\det(A+B)=\det(\phi(A)+\phi(B))$. Then we have $${\rm tr}(AB^{-1}) = {\rm tr}(\phi(A){\phi(B)}^{-1}).$$ Through this viewpoint, we show that $\phi$ is of the form…

A map between operator spaces is called completely coarse if the sequence of its amplifications is equi-coarse. We prove that all completely coarse maps must be $\mathbb R$-linear. On the opposite direction of this result, we introduce a…

Convex geometries form a subclass of closure systems with unique criticals, or $UC$-systems. We show that the $F$-basis introduced in [1] for $UC$-systems, becomes optimum in convex geometries, in two essential parts of the basis: right…

We describe a way to approximate the matrix elements of a real power $\alpha$ of a positive (for $\alpha \ge 0$) or non-negative (for $\alpha \in \mathbb{R}$), infinite, bounded, sparse and Hermitian matrix $W$. The approximation uses only…

The structure of cones of positive and k-positive maps acting on a finite-dimensional Hilbert space is investigated. Special emphasis is given to their duality relations to the sets of superpositive and k-superpositive maps. We characterize…

This paper studies first-order algorithms for solving fully composite optimization problems over convex and compact sets. We leverage the structure of the objective by handling its differentiable and non-differentiable components…

In this work, we adapt Sinkhorn-Knopp theorem for rectangular positive maps $(T:M_k\rightarrow M_m)$. We extend their concepts of support and total support to these maps. We show that a positive map $T:M_k\rightarrow M_m$ is equivalent to a…

We extend the classical links between valuations and orderings on fields to Tignol-Wadsworth gauges and positive cones on finite-dimensional simple algebras with involution. We also study the compatibility of gauges and positive cones, and…

We present positive maps and matrix inequalities for variables from the positive cone. These inequalities contain partial transpose and reshuffling operations, and can be understood as positive multilinear maps that are in one-to-one…

We introduce the notion of a good map between topological spaces: a continuous map $f:X \to Y$ is *good* if for every non-empty irreducible locally closed subset $U \subseteq X$, there exists a non-empty open subset $W \subseteq Y$ such…

Rough set theory is a new mathematical approach to imperfect knowledge. The notion of rough sets is generalized by using an arbitrary binary relation on attribute values in information systems, instead of the trivial equality relation. The…

For any unital separable simple infinite-dimensional nuclear C*-algebra with finitely many extremal traces, we prove that Z-absorption, strict comparison, and property (SI) are equivalent. We also show that any unital separable simple…

A matching $M$ in a graph $\Gamma$ is positive if $\Gamma$ has a vertex-labeling such that $M$ coincides with the set of edges with positive weights. A positive matching decomposition (pmd) of $\Gamma$ is an edge-partition $M_1,\ldots,M_p$…

Low-rank matrix approximation, which aims to construct a low-rank matrix from an observation, has received much attention recently. An efficient method to solve this problem is to convert the problem of rank minimization into a nuclear norm…

We propose inertial versions of block coordinate descent methods for solving non-convex non-smooth composite optimization problems. Our methods possess three main advantages compared to current state-of-the-art accelerated first-order…

Motivated by reconstruction results by Rubin, we introduce a new reconstruction notion for permutation groups, transformation monoids and clones, called automatic action compatibility, which entails automatic homeomorphicity. We further…

We consider the factorization of a rectangular matrix $X $ into a positive linear combination of rank-one factors of the form $u v^\top$, where $u$ and $v$ belongs to certain sets $\mathcal{U}$ and $\mathcal{V}$, that may encode specific…

We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials and indicate potential for extensions. As our main tool, we show that for a large class of Newton maps that includes all hyperbolic…