Based on the idea of Dikin-type primal-dual affine scaling method for linear programming, we describe a high-order Dikin-type algorithm for $P_*(\kappa)$-matrix linear complementarity problem in a wide neighborhood of the central path, and its polynomial-time complexity bound is given. Finally, two numerical experiments are provided to show the effectiveness of the proposed algorithms.
