2015/01/12 by Chen Ling, Hongjin He, Ling, Chen +3
Computer Science · Mathematics · #Advanced Optimization Algorithms Research #FOS: Mathematics #Matrix Theory and Algorithms #Optimization and Control (math.OC) #Tensor decomposition and applications
paper · pdf · doi:10.48550/arxiv.1501.02604
openalex publication_date 2015/01/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.