Calmness of Nonsmooth Constraint Systems:Dual Conditions via Scalarized Exhausters

This paper considers the problem of establishing sufficient conditions for calmness, a property describing the Lipschitzian behaviour of set-valued mappings, whose introduction was strongly motivated by needs in optimization and mathematical programming. The study of such problem is undertaken in the specific context of nonsmooth constraint systems. As analysis tools, proper adaptations of known dual constructions in generalized differentiation theory and abstract convex analysis are employed. By means of them, some settings are singled out, where it is possible to formulate calmness conditions, in the case the set appearing in the constraint system is convex or prox-regular.