Calmness Modulus of Parameterized Convex Constraint Systems: Exact Closed-Form Formulas via Second-Order Admissibility
arXiv:2611.06224
Abstract
We resolve the open problem of deriving an exact, closed-form algebraic formula for the calmness modulus of convex constrained feasible set mappings under right-hand side perturbations at a given pair of the graph . First, under the condition , we prove that the calmness modulus coincides with the inverse distance from the origin to the boundary of the nominal subdifferential. Second, for general convex systems where the previously mentioned interior condition does not hold, we introduce a second-order admissibility filtering over the active indexes. We show that this filtered family, , yields an exact characterization of the calmness modulus relying solely on nominal data.