Levitin–Polyak Well-Posedness of Vector Variational Inequality Problems with Functional Constraints
X. X. Huang, Xiaoqi Yang · Numerical Functional Analysis and Optimization · 2010
The Levitin–Polyak well-posedness for a constrained problem guarantees that, for an approximating solution sequence, there is a subsequence which converges to a solution of the problem. In this article, we introduce several types of (generalized) Levitin–Polyak well-posednesses for a vector variational inequality problem with both abstract and functional constraints. Various criteria and characterizations for these types of well-posednesses are given. Relations among these types of well-posednesses are presented.