Skip to main content
Log in

Solution differentiability for variational inequalities

  • Published:
Mathematical Programming Submit manuscript

Abstract

In this paper we study solution differentiability properties for variational inequalities. We characterize Fréchet differentiability of perturbed solutions to parametric variational inequality problems defined on polyhedral sets. Our result extends the recent result of Pang and it directly specializes to nonlinear complementarity problems, variational inequality problems defined on perturbed sets and to nonlinear programming problems.

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

Access this article

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. S. Dafermos, “Sensitivity analysis in variational inequalities,”Mathematics of Operations Research 13 (1988) 421–434.

    Google Scholar 

  2. A.L. Dontchev and H.Th. Jongen, “On the regularity of the Kuhn-Tucker curve,”SIAM Journal of Control and Optimization 24 (1986) 169–176.

    Google Scholar 

  3. A.V. Fiacco, “Sensitivity analysis for nonlinear programming using penalty methods,”Mathematical Programming 10 (1976) 287–311.

    Google Scholar 

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

    Google Scholar 

  5. A.V. Fiacco and G.P. McCormick,Nonlinear Programming: Sequential Unconstrained Minimization Techniques (Wiley, New York, 1968).

    Google Scholar 

  6. J. Gauvin and R. Janin, “Directional behaviour of optimal solutions in nonlinear mathematical programming problems,”Mathematics of Operations Research 13 (1988) 629–649.

    Google Scholar 

  7. P.T. Harker and J.-S. Pang, “Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications,”Mathematical Programming (Series B) 48 (1990) 161–220, this issue.

    Google Scholar 

  8. K. Jittorntrum, “Solution point differentiability without strict complementarity in nonlinear programming,”Mathematical Programming Study 21 (1984) 127–138.

    Google Scholar 

  9. M. Kojima, “Strongly stable stationary solutions in nonlinear programs,” in: S.M. Robinson, ed.,Analysis and Computation of Fixed Points (Academic Press, New York, 1980) pp. 93–138.

    Google Scholar 

  10. J. Kyparisis, “On uniqueness of Kuhn-Tucker multipliers in nonlinear programming,”Mathematical Programming 32 (1985) 242–246.

    Google Scholar 

  11. J. Kyparisis, “Uniqueness and differentiability of solutions of parametric nonlinear complementarity prolbems,”Mathematical Programming 36 (1986) 105–113.

    Google Scholar 

  12. J. Kyparisis, “Sensitivity analysis framework for variational inequalities,”Mathematical Programming 38 (1987) 203–213.

    Google Scholar 

  13. J. Kyparisis, “Perturbed solutions of variational inequality problems over polyhedral sets,”Journal of Optimization Theory and Applications 57 (1988) 295–305.

    Google Scholar 

  14. J. Kyparisis, “Sensitivity analysis for nonlinear programs and variational inequalities with nonunique multipliers,”Mathematics of Operations Research 15 (1990) 286–298.

    Google Scholar 

  15. J.-S. Pang, “Two characterization theorems in complementarity theory,”Operations Reserach Letters 7 (1988) 27–31.

    Google Scholar 

  16. J.-S. Pang, “Solution differentiability and continuation of Newton's method for variational inequality problems over polyhedral sets,”Journal of Optimization Theory and Applications, forthcoming.

  17. A.B. Poore and C.A. Tiahrt, “Bifurcation problems in nonlinear parametric programming,”Mathematical Programming 39 (1987) 189–205.

    Google Scholar 

  18. Y. Qiu and T.L. Magnanti, “Sensitivity analysis for variational inequalities defined on polyhedral sets,”Mathematics of Operations Research 14 (1989) 410–432.

    Google Scholar 

  19. Y. Qiu and T.L. Magnanti, “Sensitivity analysis for variational inequalities,” Working Paper OR 163-87, Operations Research Center, Massachusetts Institute of Technology (Cambridge, MA, 1987).

    Google Scholar 

  20. A. Reinoza, “The strong positivity conditions,”Mathematics of Operations Research 10 (1985) 54–62.

    Google Scholar 

  21. S.M. Robinson, “Generalized equations and their solutions, Part I: Basic theory,”Mathemiatical Programming Study 10 (1979) 128–141.

    Google Scholar 

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

    Google Scholar 

  23. S.M. Robinson, “Implicit B-differentiability in generalized equations,” Technical Summary Report No. 2854, Mathematics Research Center, University of Wisconsin (Madison, WI, 1985).

    Google Scholar 

  24. S.M. Robinson, “Local strucutre of feasible sets in nonlinear programming, Part III: Stability and Sensitivity,”Mathematical Programming Study 30 (1987) 45–66.

    Google Scholar 

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

    Google Scholar 

  26. A. Shapiro, “Sensitivity analysis of nonlinear programs and differentiability properties of metric projections,”SIAM Journal of Control and Optimization 26 (1988) 628–645.

    Google Scholar 

  27. R.L. Tobin, “Sensitivity analysis for variational inequalities,”Journal of Optimization Theory and Applications 48 (1986) 191–204.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kyparisis, J. Solution differentiability for variational inequalities. Mathematical Programming 48, 285–301 (1990). https://doi.org/10.1007/BF01582260

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Navigation