Characterization of Solution Sets of Convex Programs

Abstract

This paper gives several characterizations of the solution set of convex programs. No differentiability of the functions involved in the problem definition is assumed. The result is a generalization of the results given in [3]. Furthermore, the subgradients attaining the minimum principles are explicitly characterized, and this characterization is shown to be independent of any solution.