Implicit multifunction theorems for the sensitivity analysis of variational conditions
We study implicit multifunctions (set-valued mappings) obtained from inclusions of the form 0∈M(p,x), whereM is a multifunction. Our basic implicit multifunction theorem provides an approximation for a generalized derivative of the implicit multifunction in terms of the derivative of the multifunctionM. Our primary focus is on three special cases of inclusions 0∈M(p,x) which represent different kinds of generalized variational inequalities, called “variational conditions”. Appropriate versions of our basic implicit multifunction theorem yield approximations for generalized derivatives of the solutions to each kind of variational condition. We characterize a well-known generalized Lipschitz property in terms of generalized derivatives, and use our implicit multifunction theorems to state sufficient conditions (and necessary in one case) for solutions of variational conditions to possess this Lipschitz, property. We apply our results to a general parameterized nonlinear programming problem, and derive a new second-order condition which guarantees that the stationary points associated with the Karush-Kuhn-Tucker conditions exhibit generalized Lipschitz continuity with respect to the parameter.
KeywordsImplicit mapping Sensitivity analysis Variational condition Upper Lipschitz continuity
Unable to display preview. Download preview PDF.
- A.L. Dontchev and W.W. Hager, On Robinson's implicit function theorem, in:Set-Valued Analysis and Differential Inclusions (Birkhäuser, Basel, 1991).Google Scholar
- A.L. Dontchev, Characterizations of Lipschitz stability in optimization, in: R. Lucchetti and J. Revaslki, eds.,Recent Developments in Well-posed Problems (Kluwer Academic Publishers, Dordrecht, 1995). pp. 95–115.Google Scholar
- A.V. Fiacco and J. Kyparisis, Sensitivity analysis in nonlinear programming under second order assumptions, in: A.V. Balakrishnan and E.M. Thoma, eds.,Lecture Notes in Control and Information Sciences, Vol. 66 (Springer, Berlin, 1985) pp. 74–97.Google Scholar
- D. Klatte, Nonlinear optimization under data perturbations, in: W. Krabs and J. Zowe, eds.,Modern Methods of Optimization (Springer, Berlin, 1992) pp. 204–235.Google Scholar
- A.B. Levy and R.T. Rockafellar, Sensitivity of solutions in nonlinear programming problems with nonunique multipliers, in: D.-Z. Du, L. Qi and R.S. Womersley, eds.,Recent Advances in Nonsmooth Optimization (World Scientific, Singapore, 1995) pp. 215–223.Google Scholar
- A.B. Levy and R.T. Rockafellar, Variational conditions and the proto-differentiation of partial subgradient mappings, to appear inNonlinear Analysis, Theory, Methods, and Applications 26 (1996) 1951–1964.Google Scholar
- A.B. Levy and R.T. Rockafellar, Proto-derivatives and the geometry of solution mappings in nonlinear programming, to appear inProceedings of Erice-Conference (1995).Google Scholar
- J.-S. Pang, Necessary and sufficient conditions for solution stability of parametric nonsmooth equations, in: D.-Z. Du, L. Qi and R.S. Womersley, eds.,Recent Advances in Nonsmooth Optimization (World Scientific, Singapore, 1995) pp. 261–288.Google Scholar
- R.T. Rockafellar, Proto-differentiability of set-valued mappings and its applications in optimization, in: H. Attouch, J.P. Aubin, F.H. Clarke and I. Ekeland, eds.,Analyse Non Linéaire (Gauthier-Villars, Paris, 1989) pp. 449–482.Google Scholar