Abstract
We study two projection algorithms for solving the variational inequality problem in Hilbert space. One algorithm is a modified subgradient extragradient method in which an additional projection onto the intersection of two half-spaces is employed. Another algorithm is based on the shrinking projection method. We establish strong convergence theorems for both algorithms.
| Original language | English |
|---|---|
| Pages (from-to) | 827-845 |
| Number of pages | 19 |
| Journal | Optimization Methods and Software |
| Volume | 26 |
| Issue number | 4-5 |
| DOIs | |
| State | Published - Aug 2011 |
Bibliographical note
Funding Information:We are very grateful to two anonymous referees whose insightful comments helped us to considerably improve an earlier version of this paper. This work was partially supported by Award Number R01HL070472 from the National Heart, Lung and Blood Institute, by the United States–Israel Binational Science Foundation (BSF), Grant number 200912, by the Israel Science Foundation (ISF), Grant number 647/07 and by the Fund for the Promotion of Research at the Technion and the Technion President’s Research Fund.
Keywords
- Hilbert space
- extragradient method
- projection algorithm
- subgradient
- variational inequality
ASJC Scopus subject areas
- Software
- Control and Optimization
- Applied Mathematics