Related papers: Tensor Complementarity Problem and Semi-positive T…
In this paper, we systemically introduce completely positive biquadratic (CPB) tensors and copositive biquadratic tensors. We show that all weakly CPB tensors are sum of squares tensors, the CPB tensor cone and the copositive biquadratic…
A problem of completing a linear map on C*-algebras to a completely positive map is analyzed. It is shown that whenever such a completion is feasible there exists a unique minimal completion. This theorem is used to show that under some…
Tensor completion is a core machine learning algorithm used in recommender systems and other domains with missing data. While the matrix case is well-understood, theoretical results for tensor problems are limited, particularly when the…
A semisimple algebraic tensor category over an algebraically closed field k of characteristic zero is the representation category of all finite dimensional twisted super representations of an affine reductive supergroup G over k. Such a…
It is well known that an element of the algebra of noncommutative *-polynomials is positive in all *-representations if and only if it is a sum of squares. This provides an effective way to determine if a given *-polynomial is positive, by…
The series $\theta (q,x):=\sum _{j=0}^{\infty}q^{j(j+1)/2}x^j$ converges for $|q|<1$ and defines a {\em partial theta function}. For any fixed $q\in (0,1)$ it has infinitely many negative zeros. It is known that for $q$ taking one of the…
We show that the set of realizations of a given dimension of a max-plus linear sequence is a finite union of polyhedral sets, which can be computed from any realization of the sequence. This yields an (expensive) algorithm to solve the…
Existing tensor completion formulation mostly relies on partial observations from a single tensor. However, tensors extracted from real-world data are often more complex due to: (i) Partial observation: Only a small subset (e.g., 5%) of…
In this paper we examine a symmetric tensor decomposition problem, the Gramian decomposition, posed as a rank minimization problem. We study the relaxation of the problem and consider cases when the relaxed solution is a solution to the…
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 prove the existence of a positive solution to a semipositone $N$-Laplacian problem with a critical Trudinger-Moser nonlinearity. The proof is based on obtaining uniform $C^{1,\alpha}$ a priori estimates via a compactness argument. Our…
Finding a Z-eigenpair of a symmetric tensor is equivalent to finding a KKT point of a sphere constrained minimization problem. Based on this equivalency, in this paper, we first propose a class of iterative methods to get a Z-eigenpair of a…
Yuan's theorem of the alternative is an important theoretical tool in optimization, which provides a checkable certificate for the infeasibility of a strict inequality system involving two homogeneous quadratic functions. In this paper, we…
In this paper we discuss curvature tensors in the context of Absolute Parallelism geometry. Different curvature tensors are expressed in a compact form in terms of the torsion tensor of the canonical connection. Using the Bianchi identities…
The tensor rank decomposition problem consists of recovering the unique set of parameters representing a robustly identifiable low-rank tensor when the coordinate representation of the tensor is presented as input. A condition number for…
Tensor network contraction is a powerful computational tool in quantum many-body physics, quantum information and quantum chemistry. The complexity of contracting a tensor network is thought to mainly depend on its entanglement properties,…
The paper is constructed in two parts.In the first part we introduce the concept of the algebra of Q-meromorphic functions on the quantum plane.The A (q)-algebra of Q-analytic functions considered in[6]is seen as a proper subalgebra. In the…
In this paper, we study the nonemptiness, compactness, uniqueness, and finiteness of the solution set of a new type of nonlinear complementarity problem, namely the extended horizontal tensor complementarity problem (EHTCP). We introduce…
We construct a tensor network that delivers an unnormalized quantum state whose coefficients are the solutions to a given instance of 3SAT, an NP-complete problem. The tensor network contraction that corresponds to the norm of the state…
Let $\mathbb{F}$ be an infinite field with characteristic different from two. For a graph $G=(V,E)$ with $V={1,...,n}$, let $S(G;\mathbb{F})$ be the set of all symmetric $n\times n$ matrices $A=[a_{i,j}]$ over $\mathbb{F}$ with…