Abstract
AbstractIn this paper we consider the class of mathematical programs with complementarity constraints (MPCC). Under an appropriate constraint qualification of Mangasarian–Fromovitz type we present a topological and an equivalent algebraic characterization of a strongly stable C-stationary point for MPCC. Strong stability refers to the local uniqueness, existence and continuous dependence of a solution for each sufficiently small perturbed problem where perturbations up to second order are allowed. This concept of strong stability was originally introduced by Kojima for standard nonlinear optimization; here, its generalization to MPCC demands a sophisticated technique which takes the disjunctive properties of the solution set of MPCC into account.
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference37 articles.
1. Bertsekas, D.P., Nedic, A., Ozdaglar, A.E.: Convex Analysis and Optimization. Athena Scientific, Belmont (2003)
2. Cervinka, M., Outrata, J.V., Pistek, M.: On stability of M-stationary points in MPCCs. Set-Valued Var. Anal. 22, 575–595 (2014)
3. Clarke, F.H.: Optimization and Nonsmooth Analysis. Society for Industrial and Applied Mathematics, Philadelphia (1990)
4. Dontchev, A.L., Tyrrell Rockafellar, R.: Characterizations of Lipschitzian stability in nonlinear programming. In: Mathematical Programming with Data Perturbations, pp. 65–82. Marcel Dekker, Inc (1998)
5. Dorsch, D., Günzel, H., Guerra Vázquez, F., Rückmann, J.-J.: Semi-infinite programming: strong stability implies EMFCQ. J. Convex Anal. 19(4), 999–1008 (2012)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献