Stability results for polyhedral complementarity problems
Computers & Mathematics with Applications
Descent methods for a class of generalized variational inequalities
Computational Optimization and Applications
Lipschitz Behavior of the Robust Regularization
SIAM Journal on Control and Optimization
Computational Optimization and Applications
Mathematics of Operations Research
Hi-index | 0.00 |
In this paper we study the behavior of solutions of finite-dimensional monotone affine variational inequalities posed over graph-convex polyhedral multifunctions. We identify precisely the class of positive semidefinite linear transformations appearing in these variational inequalities for which the solution sets will be Lipschitzian in the argument of the underlying multifunction. This class is that of cocoercive linear transformations, which include, but are not limited to, those appearing in problems of linear or of convex quadratic programming.