Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Stephen M. Robinson (2007) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: