On the cone eigenvalue complementarity problem for higher-order tensors
Authors:
- Chen LingCLChen Ling
- Hongjin HeHHHongjin He
- Liqun QiLQLiqun Qi
Preprint
Abstract
In this paper, we consider the tensor generalized eigenvalue complementarity problem (TGEiCP), which is a generalization of matrix eigenvalue complementarity problem (EiCP). Existence of solution for TGEiCP is discussed, and some optimization reformulations are presented. Based upon the optimization reformulation, an upper bound of cone eigenvalues of tensor is established. Some results concerning the bounds of number of eigenvalues of TGEiCP are presented. A projection algorithm for solving TGEiCP is also presented.Keywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Eigenvalue analysis of constrained minimization problem for homogeneous polynomialJournal of Global Optimization, 2015
- A new method for solving Pareto eigenvalue complementarity problemsComputational Optimization and Applications, 2013
- On eigenvalue problems of real symmetric tensorsJournal of Mathematical Analysis and Applications, 2009
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithmNumerical Algorithms, 2008
- Cone-constrained eigenvalue problems: theory and algorithmsComputational Optimization and Applications, 2008
- Numerical multilinear algebra and its applicationsFrontiers of Mathematics in China, 2007
- Z-eigenvalue methods for a global polynomial optimization problemMathematical Programming, 2007
- Eigenvalues of a real supersymmetric tensorJournal of Symbolic Computation, 2005
- Eigenvalue computation in the 20th century2001
- NP-Completeness of the linear complementarity problemJournal of Optimization Theory and Applications, 1989