  We show that an almost cyclic (or generalized Gauss- Seidel) Dykstra's
algorithm which incorporates the SHQP (supporting halfspace- quadratic
programming) strategy can achieve nonasymptotic and asymptotic linear
convergence for polyhedral problems.
