Improved analysis of algorithms based on supporting halfspaces and quadratic programming for the convex intersection and feasibility problems