A generalized alternating direction method of multipliers for tensor complementarity problems

In this paper, we consider the tensor complementarity problem (TCP). From the perspective of non-coupled equality constraint minimization problem for the symmetric TCP, we propose a generalized alternating direction method of multipliers (G-ADMM) to solve the general TCP in which the tensor may not be symmetric. The global convergence and the O(1k)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(\frac{1}{k})$$\end{document} convergence rate of the proposed method are proved under the assumption which is much weaker than the monotone assumption. Numerical results show that the method is efficient for solving the TCP.