On solvability of convex noncoercive quadratic programming problems

Abstract

Using a known result on minimization of convex functionals on polyhedral cones, the Frank–Wolfe theorem, and basic linear algebra, we give a simple proof that the general convex quadratic programming problem which satisfies a natural necessary condition has a solution.