Skip to main content
Log in

On variational inequalities over polyhedral sets

  • Full Length Paper
  • Series B
  • Published:
Mathematical Programming Submit manuscript

Abstract

The results on regularity behavior of solutions to variational inequalities over polyhedral sets proved in a series of papers by Robinson, Ralph and Dontchev-Rockafellar in the 90s has long become classics of variational analysis. But the available proofs are very complicated and practically do not use techniques of variational analysis. The only exception is the proof by Dontchev and Rockafellar of their “critical face” regularity criterion. In the paper we offer a different approach completely based on polyhedral geometry and a few basic principles of metric regularity theory. It leads to new proofs, that look simpler and shorter, and in addition gives some clarifying geometrical information.

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

Notes

  1. Facchinei and Pang write in the beginning of p. 372 to explain the absence of a general proof of the implication “coherent orientation \(\Rightarrow \) single-valuedness” after proving it for \(n=2\): “the general case \(n\ge 3\) is much more technical and difficult ...”. Likewise, Dontchev and Rockafellar write after the statement of Theorem 4H.1 that “the most important part of this theorem that, for the mapping \(f +N(C,\cdot )\) with a smooth f and a polyhedral convex set C, metric regularity is equivalent to strong metric regularity, will not be proved here in full generality. To prove this fact we need tools that go beyond the scope of this book”.

  2. Note also that there are variational inequalities with non-polyhedral C for which regularity and strong regularity are equivalent, for instance when C is an arbitrary convex set and A is symmetric positive semi-definite. This follows from the fact that for a maximal monotone operator metric regularity implies strong regularity—see [2]. Another relevant example is the critical point mapping in cone constrained convex problems [8], Corollary 1.

  3. I am thankful to an anonimous reviewer who has informed me about this paper of which I was unaware.

References

  1. Dmitruk, A.V., Milyutin, A.A., Osmolovskii, N.P.: Ljusternik’s theorem and the theory of extrema. Russ. Math. Surv. 35(6), 11–51 (1980)

    Article  MATH  Google Scholar 

  2. Dontchev, A.L., Hager, W.W.: Implicit functions, Lipschitz maps and stability in optimization. Math. Oper. Res. 3, 753–768 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  3. Dontchev, A.L., Rockafellar, R.T.: Characterizations of strong regularity for variational inequalities over polyhedral convex sets. SIAM J. Optim. 6, 1087–1105 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  4. Dontchev, A.L., Rockafellar, R.T.: Implicit Functions and Solution Mappings, 2nd edn. Springer, Berlin (2014)

    MATH  Google Scholar 

  5. Facchinei, F., Pang, J.S.: Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer, New York (2003)

    MATH  Google Scholar 

  6. Ioffe, A.D.: Metric regularity. Theory and applications—a survey, arXiv:1505.07920v2 [math.OC] (2015)

  7. Klatte, D., Kummer, B.: Nonsmooth Equations in Optimization. Kluwer, Berlin (2002)

    MATH  Google Scholar 

  8. Klatte, D., Kummer, B.: Aubin property and uniqueness in cone costrained optimization. Math. Methods Oper. Res. 77, 191–304 (2013)

    Article  MATH  Google Scholar 

  9. Kuhn, D., Löwen, R.: Piecewise affine bijections of \(I\!\!R^n\), and the equation \(Sx ^+ - Tx ^- = y\). Linear Algebra Appl. 96, 109–129 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kummer, B.: Lipschitzean and pseudo-Lipschitzean inverse functions and applications to nonlinear programming. In: Fiacco, A.V. (ed.) Mathematical Programming with Data Perturbations, pp. 201–202. Marcel Dekker, New York (1997)

    Google Scholar 

  11. Ralph, D.: A new proof of Robinson’s homeomorphism theorem for PL-normal maps. Linear Algebra Appl. 178, 249–260 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  12. Robinson, S.M.: Strongly regular generalized equations. Math. Oper. Res. 5, 43–62 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  13. Robinson, S.M.: Normal maps induced by linear transformations. Math. Oper. Res. 17, 691–714 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  14. Robinson, S.M.: The compression property of affine variational inequalities. Numer. Funct. Anal. Optim. 35, 1212–1224 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  15. Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)

    Book  MATH  Google Scholar 

  16. Rockafellar, R.T., Wets, R.J.B.: Variational Analysis. Springer, Berlin (1998)

    Book  MATH  Google Scholar 

  17. Samelson, H., Thrall, R.M., Wesler, O.: A partition theorem for Euclidear \(n\)-space. Proc. Am. Math. Soc. 9, 805–807 (1958)

    MATH  Google Scholar 

  18. Scholtes, S.: Introduction to Piecewise Differential Equations. Springer, Berlin (2012)

    Book  MATH  Google Scholar 

Download references

Acknowledgments

I wish to thank the reviewers for thoughtful comments.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alexander D. Ioffe.

Additional information

This research was supported in part by the Israel-USA BSF under the grant 2014241-2.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ioffe, A.D. On variational inequalities over polyhedral sets. Math. Program. 168, 261–278 (2018). https://doi.org/10.1007/s10107-016-1077-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-016-1077-4

Keywords

Mathematics Subject Classification

Navigation