Normal solution of the convex quadratic problems In the general form

In this work we consider the problems of finding the minimum norm solution of the convex quadratic programming having inequality and quality constrains. Our approach is based on the theorem of alternative and on a convenient characterization of the solution set of convex quadratic programming. We show that this problem reduce to an unconstrained minimization problem.

Keywords:

Alternative theorem , solution set of convex problem , the minimum norm solution ofquadratic programs