Our main goal is to compute or estimate the calmness modulus of the argmin mapping of linear semi-infinite optimization problems under canonical perturbations, i.e., perturbations of the objective function together with continuous perturbations of the right-hand side of the constraint system (with respect to an index ranging in a compact Hausdorff space). Specifically, we provide a lower bound ...

Evaluating the characteristics of ubiquitous applications is still in its infancy although this area is rapidly gaining importance as such applications are becoming common. We present a framework for evaluating the degree of calmness in ubiquitous applications. Calmness is a characteristic of the system that is experienced by the user in the usage situation, hence our evaluation framework is ta...

We study subdifferential conditions of the calmness property for multifunctions representing convex constraint systems in a Banach space. Extending earlier work in finite dimensions [R. Henrion and J. Outrata, J. Math. Anal. Appl., 258 (2001), pp. 110–130], we show that, in contrast to the stronger Aubin property of a multifunction (or metric regularity of its inverse), calmness can be ensured ...

The problem of minimizing the rank of a symmetric positive semidefinite matrix subject to constraints can be cast equivalently as a semidefinite program with complementarity constraints (SDCMPCC). The formulation requires two positive semidefinite matrices to be complementary. We investigate calmness of locally optimal solutions to the SDCMPCC formulation and hence show that any locally optimal...

We present conditions for Holder calmness and upper continuity of optimal solution sets to perturbed optimization problems in finite dimensions. Studies on type stability were a popul...

Several notions of constraint qualifications are generalized from the setting of convex inequality systems to that of convex generalized equations. This is done and investigated in terms of the coderivatives and the normal cones, and thereby we provide some characterizations for convex generalized equations to have the metric subregularity. As applications, we establish formulas of the modulus ...

The paper is devoted to the analysis of the calmness property for constraint set mappings. After some general characterizations, specific results are obtained for various types of constraints, e.g., one single nonsmooth inequality, differentiable constraints modeled by polyhedral sets, finitely and infinitely many differentiable inequalities. The obtained conditions enable the detection of calm...