In this paper we characterize those quadratic functions whose restrictions to a convex set are boundedly lower subdifferentiable and, for the case of closed hyperbolic convex sets, those which are lower subdifferentiable but not boundedly lower subdifferentiable. Once characterized, we will study the applicability of the cutting plane algorithm of Plastria to problems where the objective function is quadratic and boundedly lower subdifferentiable. © 1993 The Mathematical Programming Society, Inc.
|Publication status||Published - 1 Jun 1993|
- AMS 1980 Subject Classifications: 26B25, 90C20
- Quadratic functions
- cutting plane methods