H\"older Error Bounds and H\"older Calmness with Applications to Convex Semi-Infinite Optimization

Abstract

Using techniques of variational analysis, necessary and sufficient subdifferential conditions for H\"older error bounds are investigated and some new estimates for the corresponding modulus are obtained. As an application, we consider the setting of convex semi-infinite optimization and give a characterization of the H\"older calmness of the argmin mapping in terms of the level set mapping (with respect to the objective function) and a special supremum function. We also estimate the H\"older calmness modulus of the argmin mapping in the framework of linear programming.