Continuous Selections of Solutions to Parametric Variational Inequalities
From MaRDI portal
Publication:6195314
DOI10.1137/22m1514982MaRDI QIDQ6195314
Publication date: 13 March 2024
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Implicit solution function of P\(_{0}\) and Z matrix linear complementarity constraints
- Continuous selections. I
- A decomposition property for a class of square matrices
- Hidden Z-matrices with positive principal minors
- Two-stage stochastic variational inequalities: an ERM-solution procedure
- Stochastic variational inequalities: single-stage to multistage
- Quadratic programming and affine variational inequalities. A qualitative study.
- On the Lipschitzian properties of polyhedral multifunctions
- Newton iterations in implicit time-stepping scheme for differential linear complementarity systems
- Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games
- On variational inequalities over polyhedral sets
- Differential variational inequalities
- Lipschitz Behavior of Solutions to Convex Minimization Problems
- Implicit Functions and Solution Mappings
- Strongly Regular Generalized Equations
- Some continuity properties of polyhedral multifunctions
- The Generalized Quasi-Variational Inequality Problem
- On the Continuity of the Solution Map in Linear Complementarity Problems
- Linear complementarity problems solvable by A single linear program
- On solving linear complementarity problems as linear programs
- On a class of least-element complementarity problems
- Stability Analysis of Variational Inequalities and Nonlinear Complementarity Problems, via the Mixed Linear Complementarity Problem and Degree Theory
- Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Dynamic Stochastic Variational Inequalities and Convergence of Discrete Approximation
- A Lipschitzian Characterization of Convex Polyhedra