A Simple proof for the algorithms of relaxed $(u, v)$-cocoercive mappings and $\alpha$-inverse strongly monotone mappings | ||
| International Journal of Nonlinear Analysis and Applications | ||
| دوره 12، شماره 2، بهمن 2021، صفحه 327-333 اصل مقاله (393.41 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22075/ijnaa.2019.18336.2004 | ||
| نویسندگان | ||
| Ebrahim Soori* 1؛ Ravi Agarwal2؛ Donal ORegan3 | ||
| 1Department of Mathematics, Lorestan University, P.O. Box 465, Khoramabad, Lorestan, Iran | ||
| 2Department of Mathematics Texas and University-Kingsville 700 University Blvd., MSC 172 Kingsville, Texas 78363-8202, USA | ||
| 3School of Mathematics, Statistics, National University of Ireland, Galway, Ireland | ||
| چکیده | ||
| In this paper, a simple proof is presented for the convergence of the algorithms for the class of relaxed $(u, v)$-cocoercive mappings and $\alpha$-inverse strongly monotone mappings. Based on $\alpha$-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. | ||
| کلیدواژهها | ||
| Inverse-strongly monotone mapping؛ Strongly monotone mapping؛ Relaxed $(u, v)$-cocoercive mapping | ||
| مراجع | ||
|
| ||
|
آمار تعداد مشاهده مقاله: 16,088 تعداد دریافت فایل اصل مقاله: 9,510 |
||
| تعداد نشریات | 22 |
| تعداد شمارهها | 723 |
| تعداد مقالات | 10,402 |
| تعداد مشاهده مقاله | 72,892,304 |
| تعداد دریافت فایل اصل مقاله | 64,570,087 |