arXiv subjects

Liqun Qi

Publications and source records attributed to Liqun Qi.

At least 163 records · Page 9Linked to original sources

arXiv2015

On the cone eigenvalue complementarity problem for higher-order tensors

In this paper, we consider the tensor generalized eigenvalue complementarity problem (TGEiCP), which is an interesting generalization of matrix eigenvalue complementarity problem (EiCP). First, we given an affirmative result showing that TGEiCP is solvable and has at least one solution under some reasonable assumptions. Then, we introduce two optimization reformulations of TGEiCP, thereby beneficially establishing an upper bound of cone eigenvalues of tensors. Moreover, some new results concerning the bounds of number of eigenvalues of TGEiCP further enrich the theory of TGEiCP. Last but not least, an implementable projection algorithm for solving TGEiCP is also developed for the problem under consideration. As an illustration of our theoretical results, preliminary computational results are reported.

math.OC↗

arXiv2015

Further Results on Cauchy Tensors and Hankel Tensors

In this article, we present various new results on Cauchy tensors and Hankel tensors. { We first introduce the concept of generalized Cauchy tensors which extends Cauchy tensors in the current literature, and provide several conditions characterizing positive semi-definiteness of generalized Cauchy tensors with nonzero entries.} As a consequence, we show that Cauchy tensors are positive semi-definite if and only if they are SOS (Sum-of-squares) tensors.} Furthermore, we prove that all positive semi-definite Cauchy tensors are completely positive tensors, which means every positive semi-definite Cauchy tensor can be decomposed { as} the sum of nonnegative rank-1 tensors. We also establish that all the H-eigenvalues of nonnegative Cauchy tensors are nonnegative. Secondly, we present new mathematical properties of Hankel tensors. { We prove that an even order Hankel tensor is Vandermonde positive semi-definite if and only if its associated plane tensor is positive semi-definite. We also show that, if the Vandermonde rank of a Hankel tensor $\mathcal{A}$ is less than the dimension of the underlying space, then positive semi-definiteness of $\mathcal{A}$ is equivalent to the fact that $\mathcal{A}$ is a complete Hankel tensor, and so, is further equivalent to the SOS property of $\mathcal{A}$. Lastly, we introduce a new structured tensor called Cauchy-Hankel tensors, which is a special case of Cauchy tensors and Hankel tensors simultaneously.} Sufficient and necessary conditions are established for an even order Cauchy-Hankel tensor to be positive definite. Final remarks are listed at the end of the paper.

math.SP↗

arXiv2015

Error analysis of approximation algorithm for standard bi-quadratic programming

We consider the problem of approximately solving a standard bi-quadratic programming (StBQP), which is NP-hard. After reformulating the original problem as an equivalent copositive tensor programming, we show how to approximate the optimal solution by approximating the cone of copositive tensors via a serial polyhedral cones. The established quality of approximation shows that, a polynomial time approximation scheme (PTAS) for solving StBQP exists and can be extended to solving standard multi-quadratic programming. Some numerical examples are provided to illustrate our approach.

math.OC↗

arXiv2015

Positive Definite Tensors to Nonlinear Complementarity Problems

The main purpose of this note is to investigate some kinds of nonlinear complementarity problems (NCP). For the structured tensors, such as, symmetric positive definite tensors and copositive tensors, we derive the existence theorems on a solution of these kinds of nonlinear complementarity problems. We prove that a unique solution of the NCP exists under the condition of diagonalizable tensors.

math.NA↗

arXiv2014

Positive Semi-Definiteness of Generalized Anti-Circulant Tensors

Anti-circulant tensors have applications in exponential data fitting. They are special Hankel tensors. In this paper, we extend the definition of anti-circulant tensors to generalized anti-circulant tensors by introducing a circulant index $r$ such that the entries of the generating vector of a Hankel tensor are circulant with module $r$. In the special case when $r =n$, where $n$ is the dimension of the Hankel tensor, the generalized anticirculant tensor reduces to the anti-circulant tensor. Hence, generalized anti-circulant tensors are still special Hankel tensors. For the cases that $GCD(m, r) =1$, $GCD(m, r) = 2$ and some other cases, including the matrix case that $m=2$, we give necessary and sufficient conditions for positive semi-definiteness of even order generalized anti-circulant tensors, and show that in these cases, they are SOS tensors. This shows that, in these cases, there are no PNS (positive semidefinite tensors which are not sum of squares) Hankel tensors.

math.CO↗

arXiv2014

Circulant Tensors with Applications to Spectral Hypergraph Theory and Stochastic Process

Circulant tensors naturally arise from stochastic process and spectral hypergraph theory. The joint moments of stochastic processes are symmetric circulant tensors. The adjacency, Laplacian and signless Laplacian tensors of circulant hypergraphs are also symmetric circulant tensors. The adjacency, Laplacian and signless Laplacian tensors of directed circulant hypergraphs are circulant tensors, but they are not symmetric in general. In this paper, we study spectral properties of circulant tensors and their applications in spectral hypergraph theory and stochastic process. We show that in certain cases, the largest H-eigenvalue of a circulant tensor can be explicitly identified. In particular, the largest H-eigenvalue of a nonnegative circulant tensor can be explicitly identified. This confirms the results in circulant hypergraphs and directed circulant hypergraphs. We prove that an even order circulant B$_0$ tensor is always positive semi-definite. This shows that the Laplacian tensor and the signless Laplacian tensor of a directed circulant even-uniform hypergraph are positive semi-definite. If a stochastic process is $m$th order stationary, where $m$ is even, then its $m$th order moment, which is a circulant tensor, must be positive semi-definite. In this paper, we give various conditions for a circulant tensor to be positive semi-definite.

math.SP↗

arXiv2014

SOS-Hankel Tensors: Theory and Application

Hankel tensors arise from signal processing and some other applications. SOS (sum-of-squares) tensors are positive semi-definite symmetric tensors, but not vice versa. The problem for determining an even order symmetric tensor is an SOS tensor or not is equivalent to solving a semi-infinite linear programming problem, which can be done in polynomial time. On the other hand, the problem for determining an even order symmetric tensor is positive semi-definite or not is NP-hard. In this paper, we study SOS-Hankel tensors. Currently, there are two known positive semi-definite Hankel tensor classes: even order complete Hankel tensors and even order strong Hankel tensors. We show complete Hankel tensors are strong Hankel tensors, and even order strong Hankel tensors are SOS-Hankel tensors. We give several examples of positive semi-definite Hankel tensors, which are not strong Hankel tensors. However, all of them are still SOS-Hankel tensors. Does there exist a positive semi-definite non-SOS-Hankel tensor? The answer to this question remains open. If the answer to this question is no, then the problem for determining an even order Hankel tensor is positive semi-definite or not is solvable in polynomial-time. An application of SOS-Hankel tensors to the positive semi-definite tensor completion problem is discussed. We present an ADMM algorithm for solving this problem. Some preliminary numerical results on this algorithm are reported.

math.SP↗

arXiv2014

A Tensor Analogy of Yuan's Theorem of the Alternative and Polynomial Optimization with Sign structure

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 provide a tractable extension of Yuan's theorem of the alternative to the symmetric tensor setting. As an application, we establish that the optimal value of a class of nonconvex polynomial optimization problems with suitable sign structure (or more explicitly, with essentially non-positive coefficients) can be computed by a related convex conic programming problem, and the optimal solution of these nonconvex polynomial optimization problems can be recovered from the corresponding solution of the convex conic programming problem. Moreover, we obtain that this class of nonconvex polynomial optimization problems enjoy exact sum-of-squares relaxation, and so, can be solved via a single semidefinite programming problem.

math.OC↗

arXiv2014

Centrosymmetric, Skew Centrosymmetric and Centrosymmetric Cauchy Tensors

Recently, Zhao and Yang introduced centrosymmetric tensors. In this paper, we further introduce skew centrosymmetric tensors and centrosymmetric Cauchy tensors, and discuss properties of these three classes of structured tensors. Some sufficient and necessary conditions for a tensor to be centrosymmetric or skew centrosymmetric are given. We show that, a general tensor can always be expressed as the sum of a centrosymmetric tensor and a skew centrosymmetric tensor. Some sufficient and necessary conditions for a Cauchy tensor to be centrosymmetric or skew centrosymmetric are also given. Spectral properties on H-eigenvalues and H-eigenvectors of centrosymmetric, skew centrosymmetric and centrosymmetric Cauchy tensors are discussed. Some further questions on these tensors are raised.

math.SP↗

arXiv2014

Properties of Some Classes of Structured Tensors

In this paper, we extend some classes of structured matrices to higher order tensors. We discuss their relationships with positive semi-definite tensors and some other structured tensors. We show that every principal sub-tensor of such a structured tensor is still a structured tensor in the same class, with a lower dimension. The potential links of such structured tensors with optimization, nonlinear equations, nonlinear complementarity problems, variational inequalities and the nonnegative tensor theory are also discussed.

math.SP↗

arXiv2014

Positive Definiteness and Semi-Definiteness of Even Order Symmetric Cauchy Tensors

Motivated by symmetric Cauchy matrices, we define symmetric Cauchy tensors and their generating vectors in this paper. Hilbert tensors are symmetric Cauchy tensors. An even order symmetric Cauchy tensor is positive semi-definite if and only if its generating vector is positive. An even order symmetric Cauchy tensor is positive definite if and only if its generating vector has positive and mutually distinct entries. This extends Fiedler's result for symmetric Cauchy matrices to symmetric Cauchy tensors. Then, it is proven that the positive semi-definiteness character of an even order symmetric Cauchy tensor can be equivalently checked by the monotone increasing property of a homogeneous polynomial related to the Cauchy tensor. The homogeneous polynomial is strictly monotone increasing in the nonnegative orthant of the Euclidean space when the even order symmetric Cauchy tensor is positive definite. Furthermore, we prove that the Hadamard product of two positive semi-definite (positive definite respectively) symmetric Cauchy tensors is a positive semi-definite (positive definite respectively) tensor, which can be generalized to the Hadamard product of finitely many positive semi-definite (positive definite respectively) symmetric Cauchy tensors. At last, bounds of the largest H-eigenvalue of a positive semi-definite symmetric Cauchy tensor are given and several spectral properties on Z-eigenvalues of odd order symmetric Cauchy tensors are shown. Further questions on Cauchy tensors are raised.

math.SP↗

arXiv2014

The extremal spectral radii of $k$-uniform supertrees

In this paper, we study some extremal problems of three kinds of spectral radii of $k$-uniform hypergraphs (the adjacency spectral radius, the signless Laplacian spectral radius and the incidence $Q$-spectral radius). We call a connected and acyclic $k$-uniform hypergraph a supertree. We introduce the operation of "moving edges" for hypergraphs, together with the two special cases of this operation: the edge-releasing operation and the total grafting operation. By studying the perturbation of these kinds of spectral radii of hypergraphs under these operations, we prove that for all these three kinds of spectral radii, the hyperstar $\mathcal{S}_{n,k}$ attains uniquely the maximum spectral radius among all $k$-uniform supertrees on $n$ vertices. We also determine the unique $k$-uniform supertree on $n$ vertices with the second largest spectral radius (for these three kinds of spectral radii). We also prove that for all these three kinds of spectral radii, the loose path $\mathcal{P}_{n,k}$ attains uniquely the minimum spectral radius among all $k$-th power hypertrees of $n$ vertices. Some bounds on the incidence $Q$-spectral radius are given. The relation between the incidence $Q$-spectral radius and the spectral radius of the matrix product of the incidence matrix and its transpose is discussed.

math.SP↗

arXiv2014

An Even Order Symmetric B Tensor is Positive Definite

It is easily checkable if a given tensor is a B tensor, or a B$_0$ tensor or not. In this paper, we show that a symmetric B tensor can always be decomposed to the sum of a strictly diagonally dominated symmetric M tensor and several positive multiples of partially all one tensors, and a symmetric B$_0$ tensor can always be decomposed to the sum of a diagonally dominated symmetric M tensor and several positive multiples of partially all one tensors. When the order is even, this implies that the corresponding B tensor is positive definite, and the corresponding B$_0$ tensor is positive semi-definite. This gives a checkable sufficient condition for positive definite and semi-definite tensors. This approach is different from the approach in the literature for proving a symmetric B matrix is positive definite, as that matrix approach cannot be extended to the tensor case.

math.SP↗

arXiv2014

Fast Hankel Tensor-Vector Products and Application to Exponential Data Fitting

This paper is contributed to a fast algorithm for Hankel tensor-vector products. For this purpose, we first discuss a special class of Hankel tensors that can be diagonalized by the Fourier matrix, which is called \emph{anti-circulant} tensors. Then we obtain a fast algorithm for Hankel tensor-vector products by embedding a Hankel tensor into a larger anti-circulant tensor. The computational complexity is about $\mathcal{O}(m^2 n \log mn)$ for a square Hankel tensor of order $m$ and dimension $n$, and the numerical examples also show the efficiency of this scheme. Moreover, the block version for multi-level block Hankel tensors is discussed as well. Finally, we apply the fast algorithm to exponential data fitting and the block version to 2D exponential data fitting for higher performance.

math.NA↗

arXiv2014

Infinite and finite dimensional Hilbert tensors

For an $m$-order $n-$dimensional Hilbert tensor (hypermatrix) $\mathcal{H}_n=(\mathcal{H}_{i_1i_2\cdots i_m})$, $$\mathcal{H}_{i_1i_2\cdots i_m}=\frac1{i_1+i_2+\cdots+i_m-m+1},\ i_1,\cdots, i_m=1,2,\cdots,n$$ its spectral radius is not larger than $n^{m-1}\sin\fracπ{n}$, and an upper bound of its $E$-spectral radius is $n^{\frac{m}2}\sin\fracπ{n}$. Moreover, its spectral radius is strictly increasing and its $E$-spectral radius is nondecreasing with respect to the dimension $n$. When the order is even, both infinite and finite dimensional Hilbert tensors are positive definite. We also show that the $m$-order infinite dimensional Hilbert tensor (hypermatrix) $\mathcal{H}_\infty=(\mathcal{H}_{i_1i_2\cdots i_m})$ defines a bounded and positively $(m-1)$-homogeneous operator from $l^1$ into $l^p$ ($1<p<\infty$), and the norm of corresponding positively homogeneous operator is smaller than or equal to $\fracπ{\sqrt6}$.

math.SP↗

arXiv2014

Hankel Tensors: Associated Hankel Matrices and Vandermonde Decomposition

Hankel tensors arise from applications such as signal processing. In this paper, we make an initial study on Hankel tensors. For each Hankel tensor, we associate it with a Hankel matrix and a higher order two-dimensional symmetric tensor, which we call the associated plane tensor. If the associated Hankel matrix is positive semi-definite, we call such a Hankel tensor a strong Hankel tensor. We show that an $m$ order $n$-dimensional tensor is a Hankel tensor if and only if it has a Vandermonde decomposition. We call a Hankel tensor a complete Hankel tensor if it has a Vandermonde decomposition with positive coefficients. We prove that if a Hankel tensor is copositive or an even order Hankel tensor is positive semi-definite, then the associated plane tensor is copositive or positive semi-definite, respectively. We show that even order strong and complete Hankel tensors are positive semi-definite, the Hadamard product of two strong Hankel tensors is a strong Hankel tensor, and the Hadamard product of two complete Hankel tensors is a complete Hankel tensor. We show that all the H-eigenvalue of a complete Hankel tensors (maybe of odd order) are nonnegative. We give some upper bounds and lower bounds for the smallest and the largest Z-eigenvalues of a Hankel tensor, respectively. Further questions on Hankel tensors are raised.

math.SP↗

arXiv2013

Regular Uniform Hypergraphs, $s$-Cycles, $s$-Paths and Their largest Laplacian H-Eigenvalues

In this paper, we show that the largest signless Laplacian H-eigenvalue of a connected $k$-uniform hypergraph $G$, where $k \ge 3$, reaches its upper bound $2Δ(G)$, where $Δ(G)$ is the largest degree of $G$, if and only if $G$ is regular. Thus the largest Laplacian H-eigenvalue of $G$, reaches the same upper bound, if and only if $G$ is regular and odd-bipartite. We show that an $s$-cycle $G$, as a $k$-uniform hypergraph, where $1 \le s \le k-1$, is regular if and only if there is a positive integer $q$ such that $k=q(k-s)$. We show that an even-uniform $s$-path and an even-uniform non-regular $s$-cycle are always odd-bipartite. We prove that a regular $s$-cycle $G$ with $k=q(k-s)$ is odd-bipartite if and only if $m$ is a multiple of $2^{t_0}$, where $m$ is the number of edges in $G$, and $q = 2^{t_0}(2l_0+1)$ for some integers $t_0$ and $l_0$. We identify the value of the largest signless Laplacian H-eigenvalue of an $s$-cycle $G$ in all possible cases. When $G$ is odd-bipartite, this is also its largest Laplacian H-eigenvalue. We introduce supervertices for hypergraphs, and show the components of a Laplacian H-eigenvector of an odd-uniform hypergraph are equal if such components corresponds vertices in the same supervertex, and the corresponding Laplacian H-eigenvalue is not equal to the degree of the supervertex. Using this property, we show that the largest Laplacian H-eigenvalue of an odd-uniform generalized loose $s$-cycle $G$ is equal to $Δ(G)=2$. We also show that the largest Laplacian H-eigenvalue of a $k$-uniform tight $s$-cycle $G$ is not less than $Δ(G)+1$, if the number of vertices is even and $k=4l+3$ for some nonnegative integer $l$.

math.CO↗

arXiv2013

The necessary and sufficient conditions of copositive tensors

In this paper, it is proved that (strict) copositivity of a symmetric tensor $\mathcal{A}$ is equivalent to the fact that every principal sub-tensor of $\mathcal{A}$ has no a (non-positive) negative $H^{++}$-eigenvalue. The necessary and sufficient conditions are also given in terms of the $Z^{++}$-eigenvalue of the principal sub-tensor of the given tensor. This presents a method of testing (strict) copositivity of a symmetric tensor by means of the lower dimensional tensors. Also the equivalent definition of strictly copositive tensors is given on entire space $\mathbb{R}^n$.

math.OC↗