摘要

This paper investigates a smoothing Newton method for tensor eigenvalue complementarity problems (TEiCP) which are closely related to the optimality conditions for polynomial optimization and have wide applications. By introducing a smoothing approximation of NCP-function, the TEiCP problem can be reformulated as a system of smooth equations. Then, a smoothing Newton method is proposed for tensor eigenvalue complementarity problems (TEiCP). Its convergence and convergence rate could be guaranteed by existing results. Numerical experiments are reported to show that the proposed method is efficient and could detect more solutions than some existing optimization-based methods.