سیویلیکا را در شبکه های اجتماعی دنبال نمایید.

A Simple proof for the algorithms of relaxed (u, v)-cocoercive mappings and \alpha-inverse strongly monotone mappings

Publish Year: 1400
Type: Journal paper
Language: English
View: 156

This Paper With 7 Page And PDF Format Ready To Download

Export:

Link to this Paper:

Document National Code:

JR_IJNAA-12-2_026

Index date: 2 December 2022

A Simple proof for the algorithms of relaxed (u, v)-cocoercive mappings and \alpha-inverse strongly monotone mappings 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 \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.

A Simple proof for the algorithms of relaxed (u, v)-cocoercive mappings and \alpha-inverse strongly monotone mappings Keywords:

A Simple proof for the algorithms of relaxed (u, v)-cocoercive mappings and \alpha-inverse strongly monotone mappings authors

- -

Department of Mathematics, Lorestan University, P.O. Box ۴۶۵, Khoramabad, Lorestan, Iran

- -

Department of Mathematics Texas and University-Kingsville ۷۰۰ University Blvd., MSC ۱۷۲ Kingsville, Texas ۷۸۳۶۳-۸۲۰۲, USA

- -

School of Mathematics, Statistics, National University of Ireland, Galway, Ireland