Necessary and sufficient conditions for regularity of constraints in convex programming

This paper derives some necessary and sufficient conditions for (Lagrangean) regularity of the nondifferentiable convex programming problem. Furthermore, some weakest constraint qualifications are presented using the supporting functions and their derivatives, the outer normal cones, the single constraint function and its directional derivatives and epigraph and the projections of the outer normal cones.