In this paper, we consider the quadratic programming problem with inequality constrained. Some global optimality sufficient conditions are presented by combining the Lagrangian function, L subdifferential and L regular cones method for this problem. The results of this paper extend some corresponding results on global optimality conditions in references in present information. Numerical examples show that the global optimal sufficient condition can effectively determine the optimal solution for the non convex quadratic optimization problem
