Skip to main content
Log in

Sensitivity analysis for nonsmooth generalized equations

  • Published:
Mathematical Programming Submit manuscript

Abstract

Results pertaining to Lipschitzian and directional differentiability properties for solutions to generalized equations under very general perturbations are obtained with the aid of new differentiation concepts for multivalued maps.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J.-P. Aubin, “Lipschitz behaviour of solutions to convex minimization problems,”Mathematics of Operations Research 9 (1984) 97–102.

    Google Scholar 

  2. S. Dafermos, “Sensitivity analysis in variational inequalities,”Mathematics of Operations Research 13 (1988) 421–434.

    Google Scholar 

  3. J. Dupačová and R.J.-B. Wets, “Asymptotic behavior of statistical estimators and of optimal solutions of stochastic optimization problems,”Annals of Statistics (1988) 1517–1549.

  4. A.V. Fiacco,Introduction to Sensitivity Analysis in Nonlinear Programming (Academic Press, New York, 1983).

    Google Scholar 

  5. S. Kakutani, “A generalization of Brouwer's fixed point theorem,”Duke Mathematics Journal 8 (1941) 457–459.

    Google Scholar 

  6. A.J. King, “Asymptotic behaviour of solutions in stochastic optimization: Non-smooth analysis and the derivation of non-normal limit distributions,” Ph.D. Dissertation, University of Washington (Seattle, WA, 1986).

    Google Scholar 

  7. A.J. King, “Generalized delta theorems for multivalued mappings and measurable selections,”Mathematics of Operations Research 14 (1989) 720–736.

    Google Scholar 

  8. A.J. King and R.T. Rockafellar, “Asymptotic theory for solutions in stochastic programming and generalizedM-estimation,” to appear in:Mathematics of Operations Research.

  9. B. Kummer, “Generalized equations: solvability and regularity,”Mathematical Programming Study 21 (1984) 199–212.

    Google Scholar 

  10. B. Kummer, “Linearly and nonlinearly perturbed optimization problems in finite dimensions,” in: J. Guddat et al., eds.,Parametric Optimization and Related Topics, (Akademie-Verlag, Berlin, 1987).

    Google Scholar 

  11. J. Kyparisis, “Sensitivity analysis framework for variational inequalities,”Mathematical programming 38 (1987) 203–214.

    Google Scholar 

  12. E. Michael, “Selected selection theorems,”American Mathematical Monthly 63 (1956) 233–238.

    Google Scholar 

  13. G.J. Minty, “On the maximal domain of a ‘monotone’ function,”Michigan Mathematics Journal 8 (1961) 135–137.

    Google Scholar 

  14. G.J. Minty, “Monotone (nonlinear) operators in Hilbert space,”Duke Mathematics Journal (1962) 341–346.

  15. R.A. Poliquin, “Proto-differentiation of subgradient set-valued mappings,”Canadian Journal of Mathematics (1990) 520–532.

  16. S.M. Robinson, “Generalized equations and their solutions, part 1: basic theory,”Mathematical Programming Study 10 (1979) 128–141.

    Google Scholar 

  17. S.M. Robinson, “Strongly regular generalized equations,”Mathematics of Operations Research 5 (1980) 43–62.

    Google Scholar 

  18. S.M. Robinson, “Some continuity properties of polyhedral multifunctions,”Mathematical Programming Study 14 (1981) 206–214.

    Google Scholar 

  19. S.M. Robinson, “Generalized equations and their solutions, part II: applications to nonlinear programming,”Mathematical Programming Study 19 (1982) 200–221.

    Google Scholar 

  20. S.M. Robinson, “Local structure of feasible sets in nonlinear programming, part III: stability and sensitivity,”Mathematical programming Study 30 (1987) 45–66.

    Google Scholar 

  21. S.M. Robinson, “An implicit function theorem for a class of nonsmooth functions,”Mathematics of Operations Research 16 (1991) 292–309.

    Google Scholar 

  22. R.T. Rockafellar, “Local boundedness of nonlinear monotone operators,”Michigan Mathematics Journal 16 (1969) 397–407.

    Google Scholar 

  23. R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, NJ, 1970).

    Google Scholar 

  24. R.T. Rockafellar, “Directional differentiability of the optimal value function in a nonlinear programming problem,”Mathematical Programming Study 21 (1984) 213–216.

    Google Scholar 

  25. R.T. Rockafellar, “First and second-order epidifferentiability with applications to optimization,”Transactions of the American Mathematical Society 307 (1988) 75–108.

    Google Scholar 

  26. R.T. Rockafellar, “Proto-differentiability of set-valued mappings and its applications in optimization,” H. Attouch et al., eds.,Analyse Non Lineaire (Gauthiers-Villars, Paris, 1989) 449–482.

    Google Scholar 

  27. R.T. Rockafellar, “Second-order optimality conditions in nonlinear programming obtained by way of epi-derivatives,”Mathematics of Operations Research 14 (1989) 462–464.

    Google Scholar 

  28. A. Shapiro, “Asymptotic distribution of test statistics in the analysis of moment structures under inequality constraints,”Biometrika 72 (1985) 133–144.

    Google Scholar 

  29. A. Shapiro, “Second order sensitivity analysis and asymptotic theory of parametrized nonlinear programs,”Mathematical Programming 33 (1985) 280–299.

    Google Scholar 

  30. A. Shapiro, “On concepts of directional differentiability,”Journal of Optimization Theory and Applications 66 (1990) 477–487.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Research supported in part by grants from the Air Force Office of Scientific Research and the National Science Foundation.

Rights and permissions

Reprints and permissions

About this article

Cite this article

King, A.J., Rockafellar, R.T. Sensitivity analysis for nonsmooth generalized equations. Mathematical Programming 55, 193–212 (1992). https://doi.org/10.1007/BF01581199

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01581199

Keywords