Skip to main navigation Skip to search Skip to main content

A simple proof for Imnang’s algorithms

  • Lorestan University
  • Texas A&M University-Kingsville

Research output: Contribution to a Journal (Peer & Non Peer)Articlepeer-review

Abstract

In this paper, a simple proof of the convergence of the recent iterative algorithm by relaxed (u, v) -cocoercive mappings due to Imnang (J. Inequal. Appl. 2013:249, 2013) is presented.

Original languageEnglish
Article number165
JournalJournal of Inequalities and Applications
Volume2022
Issue number1
DOIs
Publication statusPublished - 2022

Keywords

  • Relaxed (u, v) -cocoercive mapping
  • Strong convergence
  • α-expansive mapping

Cite this