Abstract
In this paper, a simple proof is presented for the convergence of the algorithms for the class of relaxed (u, v)-cocoercive mappings and α-inverse strongly monotone mappings. Based on α-expansive maps, for example, a simple proof of the convergence of the recent iterative algorithms by relaxed (u, v)-cocoercive mappings due to Kumam-Jaiboon is provided. Also a simple proof for the convergence of the iterative algorithms by inverse-strongly monotone mappings due to Iiduka-Takahashi in a special case is provided. These results are an improvement as well as a refinement of previously known results.
| Original language | English |
|---|---|
| Pages (from-to) | 327-333 |
| Number of pages | 7 |
| Journal | International Journal of Nonlinear Analysis and Applications |
| Volume | 12 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 2021 |
Keywords
- Inverse-strongly monotone mappings
- Relaxed (u
- Strongly monotone mappings
- V)-cocoercive mappings
Fingerprint
Dive into the research topics of 'A simple proof for the algorithms of relaxed (U, v)-cocoercive mappings and α-inverse strongly monotone mappings'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver