A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming