Tangential Extremal Principles for Finite and Infinite Systems of Sets, II: Applications to Semi-infinite and Multiobjective Optimization

This paper contains selected applications of the new tangential extremal principles and related results developed in Part I to calculus rules for infinite intersections of sets and optimality conditions for problems of semi-infinite programming and multiobjective optimization with countable constraint

Error Bounds and Holder Metric Subregularity

The Holder setting of the metric subregularity property of set-valued mappings between general metric or Banach/Asplund spaces is investigated in the framework of the theory of error bounds for extended real-valued functions of two variables. A classification scheme for the general Holder metric subregularity criteria is presented. The criteria are formulated in terms of several kinds of primal and subdifferential slopes.Comment: 32 pages. arXiv admin note: substantial text overlap with arXiv:1405.113

The revelation principle and regularity conditions

The revelation principle asserts that every outcome brought by a mechanism is realized by a truthful direct mechanism. The present paper investigates the regularity conditions of these two mechanisms in the continuous space of the agent’s type. It questions what regularity condition a general mechanism confers upon a direct mechanism through the revelation principle. By so doing, we elucidate the limit of the revelation principle

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

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.Comment: 25 page