Loading...
Please wait, while we are loading the content...
Hybrid Steepest-Descent Methods for Solving Variational Inequalities Governed by Boundedly Lipschitzian and Strongly Monotone Operators
| Content Provider | Semantic Scholar |
|---|---|
| Author | He, Songnian Liang, Xiao-Lan |
| Copyright Year | 2010 |
| Abstract | Let H be a real Hilbert space and let F : H → H be a boundedly Lipschitzian and strongly monotone operator. We design three hybrid steepest descent algorithms for solving variational inequality VI C, F of finding a point x∗ ∈ C such that 〈Fx∗, x − x∗〉 ≥ 0, for all x ∈ C, where C is the set of fixed points of a strict pseudocontraction, or the set of common fixed points of finite strict pseudocontractions. Strong convergence of the algorithms is proved. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://fixedpointtheoryandapplications.springeropen.com/track/pdf/10.1155/2010/673932?site=fixedpointtheoryandapplications.springeropen.com |
| Alternate Webpage(s) | http://emis.maths.tcd.ie/EMIS/journals/HOA/FPTA/Volume2010/673932.pdf |
| Language | English |
| Access Restriction | Open |
| Subject Keyword | Algorithm Calculus of variations Convergence (action) Gradient descent Hilbert space Social inequality Variational inequality Variational principle monotone |
| Content Type | Text |
| Resource Type | Article |
