Home Generalized super-relaxed proximal point algorithms involving relative A-maximal relaxed accretive in Banach spaces
Article
Licensed
Unlicensed Requires Authentication

Generalized super-relaxed proximal point algorithms involving relative A-maximal relaxed accretive in Banach spaces

  • Mohsen Alimohammady EMAIL logo and Morteza K. Kalleji
Published/Copyright: March 18, 2014

Abstract.

A general framework for a relaxed proximal point algorithm using the notion of A-maximal accretive is developed. Convergence analysis for this algorithm in the context of solving a class of inclusion problems is explored along with some results on the resolvent operator corresponding to A-maximal accretive mappings.

MSC: 49J40; 65B05
Received: 2013-3-21
Revised: 2014-2-27
Accepted: 2014-2-28
Published Online: 2014-3-18
Published in Print: 2014-6-1

© 2014 by Walter de Gruyter Berlin/Boston

Downloaded on 16.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/apam-2013-0007/html
Scroll to top button