Related papers: Factorization of positive-semidefinite operators w…

Consider --- for the generator \({-}A\) of a symmetric contraction semigroup over some measure space $\mathrm{X}$, $1\le p < \infty$, $q$ the dual exponent and given measurable functions $F_j,\: G_j : \mathbb{C}^d \to \mathbb{C}$ --- the…

Matrix factorization is a popular approach for large-scale matrix completion. The optimization formulation based on matrix factorization can be solved very efficiently by standard algorithms in practice. However, due to the non-convexity…

We first prove semi-orthogonal decompositions of derived factorization categories arising from sums of potentials of gauged Landau-Ginzburg models, where the sums are not necessarily Thom--Sebastiani type. We then apply the result to the…

The affine inverse eigenvalue problem consists of identifying a real symmetric matrix with a prescribed set of eigenvalues in an affine space. Due to its ubiquity in applications, various instances of the problem have been widely studied in…

For linear operators which factor with suitable assumptions concerning commutativity of the factors, we introduce several notions of a decomposition. When any of these hold then questions of null space and range are subordinated to the same…

For $f \in H^p(\delta^2)$, $0<p\leq 2$, with Haar expansion $f=\sum f_{I \times J}h_{I\times J}$ we constructively determine the Pietsch measure of the $2$-summing multiplication operator \[\mathcal{M}_f:\ell^{\infty} \rightarrow…

This paper studies an optimization problem on the sum of traces of matrix quadratic forms in $m$ semi-orthogonal matrices, which can be considered as a generalization of the synchronization of rotations. While the problem is nonconvex, the…

This paper studies the problem of deterministic rank-one matrix completion. It is known that the simplest semidefinite programming relaxation, involving minimization of the nuclear norm, does not in general return the solution for this…

The low-rank matrix completion problem asks whether a given real matrix with missing values can be completed so that the resulting matrix has low rank or is close to a low-rank matrix. The completed matrix is often required to satisfy…

For a perfect Lie algebra $\mathfrak{h}$ we classify all Lie algebras containing $\mathfrak{h}$ as a subalgebra of codimension $1$. The automorphism groups of such Lie algebras are fully determined as subgroups of the semidirect product…

Realizing free semicircular elements on the full Fock space, we prove an equivalence between rationality of operators obtained from them and finiteness of the rank of their commutators with right annihilation operators. This is an analogue…

Some subadditivity results involving symmetric (unitarily invariant) norms are obtained. For instance, if $g(t)=\sum_{k=0}^m a_kt^k$ is a polynomial of degree $m$ with non-negative coefficients, then, for all positive operators $A,\,B$ and…

Let $R$ be a commutative unital ring. A well-known factorization problem is whether any matrix in $\mathrm{SL}_n(R)$ is a product of elementary matrices with entries in $R$. To solve the problem, we use two approaches based on the notion of…

A common optimization problem is the minimization of a symmetric positive definite quadratic form $< x,Tx >$ under linear constrains. The solution to this problem may be given using the Moore-Penrose inverse matrix. In this work we extend…

In the short note we prove that for every $0<p<1$, there exists an infinite dimensional closed linear subspace of $\mathcal{L}\left( \ell_{p};\ell_{p}\right) $ every nonzero element of which is non $(r,s)$-absolutely summing operator for…

We show that, if a simple $C^{*}$-algebra $A$ is topologically finite-dimensional in a suitable sense, then not only $K_{0}(A)$ has certain good properties, but $A$ is even accessible to Elliott's classification program. More precisely, we…

This paper considers the problem of positive semidefinite factorization (PSD factorization), a generalization of exact nonnegative matrix factorization. Given an $m$-by-$n$ nonnegative matrix $X$ and an integer $k$, the PSD factorization…

The solution of many physical evolution equations can be expressed as an exponential of two or more operators acting on initial data. Accurate solutions can be systematically derived by decomposing the exponential in a product form. For…

This paper studies the problem of finding best rank-1 approximations for both symmetric and nonsymmetric tensors. For symmetric tensors, this is equivalent to optimizing homogeneous polynomials over unit spheres; for nonsymmetric tensors,…

We will use commutators to provide decompositions of $3\times 3$ matrices as sums whose terms satisfy some polynomial identities, and we apply them to bounded linear operators and endomorphisms of free modules of infinite rank. In…