Abstract In this paper, we propose a least-change secant algorithm to solve the generalized complementarity problem indirectly trough its reformulation as a nonsmooth system of nonlinear equations using a one-parametric family of complementarity functions. We present local and superlinear convergence results of new algorithm and analyze its numerical performance.