Technical Note—Direct Proof of the Existence Theorem for Quadratic Programming

Abstract

A direct analytical proof is given for the following theorem: If the infimum of a quadratic function on a nonempty (possibly unbounded) polyhedral set R ⊆ ℛ n is finite, then the infimum is assumed somewhere on R , thus being a minimum.