Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 440-459 |
| Number of pages | 20 |
| Journal | Numerical Functional Analysis and Optimization |
| Volume | 31 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 1 Apr 2010 |
Keywords
- Approximating solution sequence
- Cone-coercivity
- Cone-monotonicity
- Generalized Levitin-Polyak well-posedness
- Vector variational inequality with functional constraints
ASJC Scopus subject areas
- Analysis
- Signal Processing
- Computer Science Applications
- Control and Optimization