Iterative Algorithms for Variational Inequalities Governed by Boundedly Lipschitzian and Strongly Monotone Operators
Consider the variational inequality VI(C,F) of finding a point x*∈C satisfying the property 〈Fx*,x-x*〉≥0 for all x∈C, where C is a level set of a convex function defined on a real Hilbert space H and F:H→H is a boundedly Lipschitzian (i.e., Lipschitzian on bounded subsets of H) and strongly monotone...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2015-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2015/175254 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Consider the variational inequality VI(C,F) of finding a point x*∈C satisfying the property 〈Fx*,x-x*〉≥0 for all x∈C, where C is a level set of a convex function defined on a real Hilbert space H and F:H→H is a boundedly Lipschitzian (i.e., Lipschitzian on bounded subsets of H) and strongly monotone operator. He and Xu proved that this variational inequality has a unique solution and devised iterative algorithms to approximate this solution (see He and Xu, 2009). In this paper, relaxed and self-adaptive iterative algorithms are proposed for computing this unique solution. Since our algorithms avoid calculating the projection PC (calculating PC by computing a sequence of projections onto half-spaces containing the original domain C) directly and select the stepsizes through a self-adaptive way (having no need to know any information of bounded Lipschitz constants of F (i.e., Lipschitz constants on some bounded subsets of H)), the implementations of our algorithms are very easy. The algorithms in this paper improve and extend the corresponding results of He and Xu. |
|---|---|
| ISSN: | 1110-757X 1687-0042 |