Boundary of subdifferentials and calmness moduli in linear semi-infinite optimization
- 189 Downloads
This paper was originally motivated by the problem of providing a point-based formula (only involving the nominal data, and not data in a neighborhood) for estimating the calmness modulus of the optimal set mapping in linear semi-infinite optimization under perturbations of all coefficients. With this aim in mind, the paper establishes as a key tool a basic result on finite-valued convex functions in the \(n\)-dimensional Euclidean space. Specifically, this result provides an upper limit characterization of the boundary of the subdifferential of such a convex function. When applied to the supremum function associated with our constraint system, this characterization allows us to derive an upper estimate for the aimed calmness modulus in linear semi-infinite optimization under the uniqueness of nominal optimal solution.
KeywordsVariational analysis Calmness Semi-infinite programming Linear programming
- 12.Klatte, D. Kummer, B.: Nonsmooth equations in optimization: regularity, calculus, methods and applications. Nonconvex Optimization and Its Applications, vol. 60 Kluwer Academic, Dordrecht (2002)Google Scholar
- 16.Mordukhovich, B.S.: Variational analysis and generalized differentiation, I: basic theory. Springer, Berlin (2006)Google Scholar