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.
Keywords: Variational inclusions; proximal point algorithm; resolvent operator; relative maximal accretive mapping
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
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Frontmatter
- Generalized super-relaxed proximal point algorithms involving relative A-maximal relaxed accretive in Banach spaces
- Iteration schema for common fixed points of nonlinear mappings in spaces of nonpositive curvature
- Spectrum of quantum dynamical systems: Subsystems and entropy
- Characterizations of a special family of Hq-semiclassical orthogonal q-polynomials of class one
- Comparison of solutions of Boussinesq systems
- The distance of L∞ from BMO on metric measure spaces
Keywords for this article
Variational inclusions;
proximal point algorithm;
resolvent operator;
relative maximal accretive mapping
Articles in the same Issue
- Frontmatter
- Generalized super-relaxed proximal point algorithms involving relative A-maximal relaxed accretive in Banach spaces
- Iteration schema for common fixed points of nonlinear mappings in spaces of nonpositive curvature
- Spectrum of quantum dynamical systems: Subsystems and entropy
- Characterizations of a special family of Hq-semiclassical orthogonal q-polynomials of class one
- Comparison of solutions of Boussinesq systems
- The distance of L∞ from BMO on metric measure spaces