Related papers: Geometric Mean of Partial Positive Definite Matric…
In this work, we study the properties of a pentadiagonal symmetric matrix with perturbed corners. More specifically, we present explicit expressions for characterizing when this matrix is non-negative and positive definite in two special…
In this paper, we investigate some properties of planar harmonic mappings. First, we generalize the main results in \cite{CPW3} and \cite{HT}, and then discuss the relationship between area integral means and harmonic Hardy spaces or…
Consider the following noncommutative arithmetic-geometric mean inequality: given positive-semidefinite matrices $\mathbf{A}_1, \dots, \mathbf{A}_n$, the following holds for each integer $m \leq n$: $$ \frac{1}{n^m}\sum_{j_1, j_2, \dots,…
We study the problem of low-rank matrix completion for symmetric matrices. The minimum rank of a completion of a generic partially specified symmetric matrix depends only on the location of the specified entries, and not their values, if…
A linear map between matrix spaces is positive if it maps positive semidefinite matrices to positive semidefinite ones, and is called completely positive if all its ampliations are positive. In this article quantitative bounds on the…
This paper presents a unified geometric framework for the statistical analysis of a general ill-posed linear inverse model which includes as special cases noisy compressed sensing, sign vector recovery, trace regression, orthogonal matrix…
We investigate the set a) of positive, trace preserving maps acting on density matrices of size N, and a sequence of its nested subsets: the sets of maps which are b) decomposable, c) completely positive, d) extended by identity impose…
As one of the least squares mean, we consider the Wasserstein mean of positive definite Hermitian matrices. We verify in this paper the inequalities of the Wasserstein mean related with a strictly positive and unital linear map, the…
Most recent results in matrix completion assume that the matrix under consideration is low-rank or that the columns are in a union of low-rank subspaces. In real-world settings, however, the linear structure underlying these models is…
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…
Let $H$ be a positive semi-definite matrix partitioned in $\beta\times \beta$ Hermitian blocks, $H=[A_{s,t}]$, $1\le s,t,\le \beta$. Then, for all symmetric norms, {equation*} \| H \| \le \| \sum_{s=1}^{\beta} A_{s,s} \|. {equation*} The…
In this paper, we propose a novel method for matrix completion under general non-uniform missing structures. By controlling an upper bound of a novel balancing error, we construct weights that can actively adjust for the non-uniformity in…
The problem of completing a large matrix with lots of missing entries has received widespread attention in the last couple of decades. Two popular approaches to the matrix completion problem are based on singular value thresholding and…
We give two new global and algorithmic constructions of the reproducing kernel Hilbert space associated to a positive definite kernel. We further present ageneral positive definite kernel setting using bilinear forms, and we provide new…
We propose and discuss how basic notions (quadratic modules, positive elements, semialgebraic sets, Archimedean orderings) and results (Positivstellensaetze) from real algebraic geometry can be generalized to noncommutative $*$-algebras. A…
We focus on inverse preconditioners based on minimizing $F(X) = 1-\cos(XA,I)$, where $XA$ is the preconditioned matrix and $A$ is symmetric and positive definite. We present and analyze gradient-type methods to minimize $F(X)$ on a suitable…
In recent years, structured matrix recovery problems have gained considerable attention for its real world applications, such as recommender systems and computer vision. Much of the existing work has focused on matrices with low-rank…
A popular class of priors for symmetric positive-definite matrices assumes independent entries and adds a truncation to ensure positive-definiteness. While conceptually simple and often computationally convenient, unless done carefully this…
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…
Some inequalities for positive linear maps on matrix algebras are given, especially asymmetric extensions of Kadison's inequality and several operator versions of Chebyshev's inequality. We also discuss well-known results around the matrix…