Technical Note—Direct Proof of the Existence Theorem for Quadratic Programming
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Institute for Operations Research and the Management Sciences
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.
Description
Citaciones: 26