In this paper, the relaxation algorithm and two Uzawa type algorithms for solving discretized variational inequalities arising from the two-phase Stefan type problem are proposed. An analysis of their convergence is presented and the upper bounds of the convergence rates are derived. Some numerical experiments are shown to demonstrate that for the second Uzawa algorithm which is an improved version of the first Uzawa algorithm, the convergence rate is uniformly bounded away from 1 if τh-2 is kept bounded, where τ is the time step size and h the space mesh size.