Calmness of the Argmin Mapping in Linear Semi-Infinite Optimization
- 404 Downloads
This paper characterizes the calmness property of the argmin mapping in the framework of linear semi-infinite optimization problems under canonical perturbations; i.e., continuous perturbations of the right-hand side of the constraints (inequalities) together with perturbations of the objective function coefficient vector. This characterization is new for semi-infinite problems without requiring uniqueness of minimizers. For ordinary (finitely constrained) linear programs, the calmness of the argmin mapping always holds, since its graph is piecewise polyhedral (as a consequence of a classical result by Robinson). Moreover, the so-called isolated calmness (corresponding to the case of unique optimal solution for the nominal problem) has been previously characterized. As a key tool in this paper, we appeal to a certain supremum function associated with our nominal problem, not involving problems in a neighborhood, which is related to (sub)level sets. The main result establishes that, under Slater constraint qualification, perturbations of the objective function are negligible when characterizing the calmness of the argmin mapping. This result also states that the calmness of the argmin mapping is equivalent to the calmness of the level set mapping.
KeywordsCalmness Local error bounds Variational analysis Semi-infinite programming Linear programming
- 1.Mordukhovich, B.S.: Variational Analysis and Generalized Differentiation, I: Basic Theory. Springer, Berlin (2006) Google Scholar
- 3.Klatte, D., Kummer, B.: Nonsmooth Equations in Optimization: Regularity. Calculus, Methods and Applications. Nonconvex Optim. Appl., vol. 60. Kluwer Academic, Dordrecht (2002) Google Scholar
- 4.Mordukhovich, B.S.: Variational Analysis and Generalized Differentiation, II: Applications. Springer, Berlin (2006) Google Scholar