Outer Limit of Subdifferentials and Calmness Moduli in Linear and Nonlinear Programming

With a common background and motivation, the main contributions of this paper are developed in two different directions. Firstly, we are concerned with functions, which are the maximum of a finite amount of continuously differentiable functions of n real variables, paying special attention to the case of polyhedral functions. For these max‐functions, we obtain some results about outer limits of subdifferentials, which are applied to derive an upper bound for the calmness modulus of nonlinear systems. When confined to the convex case, in addition, a lower bound on this modulus is also obtained. Secondly, by means of a Karush–Kuhn–Tucker index set approach, we are also able to provide a point‐based formula for the calmness modulus of the argmin mapping of linear programming problems, without any uniqueness assumption on the optimal set. This formula still provides a lower bound in linear semi‐infinite programming. Illustrative examples are given.