摘要：We present a sequential linear complementarity problem approach and a linear equation approach to the tensor complementarity problem with a strong M-tensor, which we call the M-tensor complementarity problem (M-TCP). The subproblems of the method are linear complementarity problems (LCP) or lower dimensional system of linear equations with a constant M-matrix independent of the iteration. The subproblem is not a linearization to the M-TCP but can be solved by solving a linear complementarity problem. We show that if the initial point is appropriately chosen, the generated sequence of iterates converges to a solution of the M-TCP monotonically. At last, we do numerical experiments to test the proposed methods.