### Abstract

We investigate the convergence analysis of the following general inexact algorithm for approximating a zero of the sum of a cocoercive operator A and maximal monotone operators B with D(B)⊂H: xn+1=αnf(xn)+γnxn+δn(I+rnB)-1(I-rnA)xn+en, for n=1,2,., for given x1 in a real Hilbert space H, where (αn), (γn), and (δn) are sequences in (0,1) with αn+γn+δn=1 for all n≥1, (en) denotes the error sequence, and f:H→H is a contraction. The algorithm is known to converge under the following assumptions on δn and en: (i) (δn) is bounded below away from 0 and above away from 1 and (ii) (en) is summable in norm. In this paper, we show that these conditions can further be relaxed to, respectively, the following: (i) (δn) is bounded below away from 0 and above away from 3/2 and (ii) (en) is square summable in norm; and we still obtain strong convergence results.

Original language | English |
---|---|

Article number | 2371857 |

Journal | Abstract and Applied Analysis |

Volume | 2016 |

DOIs | |

Publication status | Published - Jan 1 2016 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Analysis
- Applied Mathematics

### Cite this

}

**The Viscosity Approximation Forward-Backward Splitting Method for Zeros of the Sum of Monotone Operators.** / Boikanyo, Oganeditse Aaron.

Research output: Contribution to journal › Article

TY - JOUR

T1 - The Viscosity Approximation Forward-Backward Splitting Method for Zeros of the Sum of Monotone Operators

AU - Boikanyo, Oganeditse Aaron

PY - 2016/1/1

Y1 - 2016/1/1

N2 - We investigate the convergence analysis of the following general inexact algorithm for approximating a zero of the sum of a cocoercive operator A and maximal monotone operators B with D(B)⊂H: xn+1=αnf(xn)+γnxn+δn(I+rnB)-1(I-rnA)xn+en, for n=1,2,., for given x1 in a real Hilbert space H, where (αn), (γn), and (δn) are sequences in (0,1) with αn+γn+δn=1 for all n≥1, (en) denotes the error sequence, and f:H→H is a contraction. The algorithm is known to converge under the following assumptions on δn and en: (i) (δn) is bounded below away from 0 and above away from 1 and (ii) (en) is summable in norm. In this paper, we show that these conditions can further be relaxed to, respectively, the following: (i) (δn) is bounded below away from 0 and above away from 3/2 and (ii) (en) is square summable in norm; and we still obtain strong convergence results.

AB - We investigate the convergence analysis of the following general inexact algorithm for approximating a zero of the sum of a cocoercive operator A and maximal monotone operators B with D(B)⊂H: xn+1=αnf(xn)+γnxn+δn(I+rnB)-1(I-rnA)xn+en, for n=1,2,., for given x1 in a real Hilbert space H, where (αn), (γn), and (δn) are sequences in (0,1) with αn+γn+δn=1 for all n≥1, (en) denotes the error sequence, and f:H→H is a contraction. The algorithm is known to converge under the following assumptions on δn and en: (i) (δn) is bounded below away from 0 and above away from 1 and (ii) (en) is summable in norm. In this paper, we show that these conditions can further be relaxed to, respectively, the following: (i) (δn) is bounded below away from 0 and above away from 3/2 and (ii) (en) is square summable in norm; and we still obtain strong convergence results.

UR - http://www.scopus.com/inward/record.url?scp=84971493161&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84971493161&partnerID=8YFLogxK

U2 - 10.1155/2016/2371857

DO - 10.1155/2016/2371857

M3 - Article

VL - 2016

JO - Abstract and Applied Analysis

JF - Abstract and Applied Analysis

SN - 1085-3375

M1 - 2371857

ER -