Access the full text.
Sign up today, get DeepDyve free for 14 days.
A. Dontchev, W. Hager (1994)
Implicit Functions, Lipschitz Maps, and Stability in OptimizationMath. Oper. Res., 19
A. Dmitruk, A. Milyutin, N. Osmolovskii (1980)
LYUSTERNIK'S THEOREM AND THE THEORY OF EXTREMARussian Mathematical Surveys, 35
(1958)
A partition theorem for Euclidear n-space
A. Dontchev, R. Rockafellar (1996)
Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex SetsSIAM J. Optim., 6
S. Robinson (1980)
Strongly Regular Generalized EquationsMath. Oper. Res., 5
D Kuhn, R Löwen (1987)
Piecewise affine bijections of $$I\!\!R^n$$ I R n , and the equation $$Sx ^+ - Tx ^- = y$$ S x + - T x - = yLinear Algebra Appl., 96
(2012)
Introduction to Piecewise Differential Equations
A. Dontchev, R. Rockafellar (2009)
Implicit Functions and Solution Mappings
D. Kuhn, R. Löwen (1987)
Piecewise affine bijections of Rn, and the equation Sx+−Tx−=yLinear Algebra and its Applications, 96
H Samelson, RM Thrall, O Wesler (1958)
A partition theorem for Euclidear $$n$$ n -spaceProc. Am. Math. Soc., 9
B Kummer (1997)
Mathematical Programming with Data Perturbations
RT Rockafellar (1970)
Convex Analysis
S. Robinson (1992)
Normal Maps Induced by Linear TransformationsMath. Oper. Res., 17
(2013)
Aubinproperty anduniqueness in cone costrainedoptimization
S. Robinson (2014)
The Compression Property for Affine Variational InequalitiesNumerical Functional Analysis and Optimization, 35
D. Klatte (2002)
Nonsmooth equations in optimization
(1997)
Lipschitzean and pseudo-Lipschitzean inverse functions and applications to nonlinear programming
D. Ralph (1993)
A new proof of Robinson's homeomorphism theorem for pl-normal mapsLinear Algebra and its Applications, 178
Bastian Goldlücke (2014)
Variational Analysis
F. Facchinei, J. Pang (2003)
Finite-Dimensional Variational Inequalities and Complementarity Problems
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.
Mathematical Programming – Springer Journals
Published: Oct 19, 2016
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.