Generalized Subgradients in Mathematical Programming

Abstract

Mathematical programming problems, and the techniques used in solving them, naturally involve functions that may well fail to be differentiable. Such functions often have "subdifferential" properties of a sort not covered in classical analysis, but which provide much information about local behavior. This paper outlines the fundamentals of a recently developed theory of generalized directional derivatives and sub-gradients.