Sufficient Global Optimality Conditions for Some Nonconvex Quadratic Program Problems

In this paper,a class of quadratic program problem with quadratic constrains is studied.Some sufficient global optimality conditions for some nonconvex quadratic program problems with quadratic constrains are presented according to the property of L-subdifferential,which ensures that a feasible point is a global minimzer of a nonconvex quadratic minimization problem subject to quadratic constraints.