With respect to general convex quadratic programming(CQP),we first combined the dual problem of(CQP) and proposed a necessary and sufficient condition.Then we gave an iterative projection and contraction method for(CQP)and proved the global convergence.