$L^\infty$-error estimate for a discrete two-sided obstacle problem and multilevel projective algorithm

We are interested in the approximation in the $L^\infty$-norm of variational inequalities with two-sided obstacle. We show that the order of convergence will be the same as that of variational inequalities with one obstacle. We also give multilevel projective algorithm and discuss its convergence.