### Abstract

Several strong convergence results involving two distinct four parameter proximal point algorithms are proved under different sets of assumptions on these parameters and the general condition that the error sequence converges to zero in norm. Thus our results address the two important problems related to the proximal point algorithm one being that of strong convergence (instead of weak convergence) and the other one being that of acceptable errors. One of the algorithms discussed was introduced by Yao and Noor (2008) [7] while the other one is new and it is a generalization of the regularization method initiated by Lehdili and Moudafi (1996) [9] and later developed by Xu (2006) [8]. The new algorithm is also ideal for estimating the convergence rate of a sequence that approximates minimum values of certain functionals. Although these algorithms are distinct, it turns out that for a particular case, they are equivalent. The results of this paper extend and generalize several existing ones in the literature.

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

Pages (from-to) | 544-555 |

Number of pages | 12 |

Journal | Nonlinear Analysis, Theory, Methods and Applications |

Volume | 74 |

Issue number | 2 |

DOIs | |

Publication status | Published - Jan 15 2011 |

### All Science Journal Classification (ASJC) codes

- Analysis
- Applied Mathematics

## Fingerprint Dive into the research topics of 'Four parameter proximal point algorithms'. Together they form a unique fingerprint.

## Cite this

*Nonlinear Analysis, Theory, Methods and Applications*,

*74*(2), 544-555. https://doi.org/10.1016/j.na.2010.09.008