相关论文: Functions preserving nonnegativity of matrices

In this paper, we give some characterizations of orthogonality preserving mappings between inner product spaces. Furthermore, we study the linear mappings that preserve some angles. One of our main results states that if $\mathcal{X},…

This is the first of two papers to describe a matrix sparsification algorithm that takes a general real or complex matrix as input and produces a sparse output matrix of the same size. The non-zero entries in the output are chosen to…

Nonnegative matrix factorization (NMF) is widely used for clustering with strong interpretability. Among general NMF problems, symmetric NMF is a special one that plays an important role in graph clustering where each element measures the…

A positive definiteness criterion and, under the additional conditions, a nonnegativity criterion for a self-adjoint continuous operator matrix, acting in product of an arbitrary number of real separable Hilbert spaces, are obtained. As…

In this paper, we prove the convexity of trace functionals $$(A,B,C)\mapsto \text{Tr}|B^{p}AC^{q}|^{s},$$ for parameters $(p,q,s)$ that are best possible, where $B$ and $C$ are any $n$-by-$n$ positive definite matrices, and $A$ is any…

In this article, we study exponents which preserve complete monotonicity of functions on lattices. We prove that for any completely monotone function $f$ on a finite lattice, $f^\alpha$ is completely monotone for all $\alpha\geq c$, where…

Let $(\Sigma_A, \sigma)$ be a subshift of finite type and let $M(x)$ be a continuous function on $\Sigma_A$ taking values in the set of non-negative matrices. We extend the classical scalar pressure function to this new setting and prove…

We consider non oscillatory functions and prove an everywhere Fourier Inversion Theorem for functions of very moderate decrease. The proofs rely on some ideas in nonstandard analysis.

We prove inequalities on non-integer powers of products of generalized matrices functions on the sum of positive semi-definite matrices. For example, for any real number $r \in \{1\} \cup [2, \infty)$, positive semi-definite matrices $A_i,\…

We prove a stability version of a general result that bounds the permanent of a matrix in terms of its operator norm. More specifically, suppose $A$ is an $n \times n$ matrix over $\mathbb{C}$ (resp. $\mathbb{R}$), and let $\mathcal{P}$…

In this paper we determine those bijective maps of the set of all positive definite $n\times n$ complex matrices which preserve a given Bregman divergence corresponding to a differentiable convex function that satisfies certain conditions.…

We analyze matrix convex functions of a fixed order defined on a real interval by differential methods as opposed to the characterization in terms of divided differences given by Kraus. We obtain for each order conditions for matrix…

Optimizing non-convex functions is a fundamental challenge across machine learning and combinatorial optimization. We introduce and study $\gamma$-weakly $\theta$-up-concavity, a novel first-order condition that characterizes a broad class…

Let $\mathbb{P}_G([0,\infty))$ and $\mathbb{P}_G^{'}([0,\infty))$ be the sets of positive semidefinite and positive definite matrices of order $n$, respectively, with nonnegative entries, where some positions of zero entries are restricted…

Based on both the fundamental theorem of affine geometry in regular $L^0$-modules and the recent progress in random convex analysis, this paper characterizes the stable fully order preserving and order reversing operators acting on the…

We study the beta functions for four-dimensional conformal gravity using two different parametrizations of metric fluctuation, linear split and exponential parametrization. We find that after imposing the traceless conditions, the beta…

Nonnegative matrix factorization (NMF) has become a widely used tool for the analysis of high-dimensional data as it automatically extracts sparse and meaningful features from a set of nonnegative data vectors. We first illustrate this…

The objective of this manuscript is to understand the structure of an invertible linear map on the space of real symmetric matrices $\mathcal{S}^n$ that leaves invariant the closed convex cones of copositive and completely positive matrices…

In this paper we assemble some results about the upper-semicontinuity and lower-semicontinuity of the feasible correspondence and the solution correspondence of linear programming problems allowing variability of all parameters of such…

A symmetric matrix $C$ is completely positive (CP) if there exists an entrywise nonnegative matrix $B$ such that $C=BB^T$. The CP-completion problem is to study whether we can assign values to the missing entries of a partial matrix (i.e.,…