An Alternative Method for A Global Analysis of Quadratic Programs in a Finite Number of Steps.

摘要

This paper considers the global analysis of general quadratic programs in a finite number of steps. A procedure is presented for recursively finding either the global minimum or a halfline of the constraint set along which the minimand is unbounded below. (Author)