Generalized relaxed proximal point algorithms involving relative maximal accretive models with applications in Banach spaces

9Citations
Citations of this article
127Readers
Mendeley users who have this article in their library.

Abstract

General models for the relaxed proximal point algorithm using the notion of relative maximal accretiveness (RMA) are developed, and then the convergence analysis for these models in the context of solving a general class of nonlinear inclusion problems differs significantly than that of Rockafellar (1976), where the local Lipschitz continuity at zero is adopted instead. Moreover, our approach not only generalizes convergence results to real Banach space settings, but also provides a suitable alternative to other problems arising from other related fields. © 2010 The Korean Mathematical Society.

Cite

CITATION STYLE

APA

Verma, R. U. (2010). Generalized relaxed proximal point algorithms involving relative maximal accretive models with applications in Banach spaces. Communications of the Korean Mathematical Society, 25(2), 313–325. https://doi.org/10.4134/CKMS.2010.25.2.313

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free