Convergence of sequential parafirmly nonexpansive mappings in reflexive Banach spaces
type: Item
instance of: scholarly article
title: Convergence of sequential parafirmly nonexpansive mappings in reflexive Banach spaces
zbMATH Open document ID: 1141.90499
published in: Journal of Optimization Theory and Applications
publication date: 2005-04-08T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C48
Mathematics Subject Classification ID: 47N10
Mathematics Subject Classification ID: 47H09
Mathematics Subject Classification ID: 47J25
zbMATH DE Number: 2154321
zbMATH Keywords: convex feasibility problems
zbMATH Keywords: Bregman projections
zbMATH Keywords: parafirmly nonexpansive mappings
zbMATH Keywords: asymptotic fixed points
zbMATH Keywords: almost cyclic control
zbMATH Keywords: underrelaxation parameters
zbMATH Keywords: bounded regularity
author: Mun Bae Lee
author: Sung Ho Park
MaRDI profile type: Publication
full work available at URL: s10957-004-5723-2
OpenAlex ID: W2062403643
cites work: Functional Operators (AM-22), Volume 2
cites work: Q5518786
cites work: Best approximation in inner product spaces
cites work: Q4010376
cites work: Q5517433
cites work: On Projection Algorithms for Solving Convex Feasibility Problems
cites work: Q4718793
cites work: Q5580053
cites work: A multiprojection algorithm using Bregman projections in a product space
cites work: An iterative row-action method for interval convex programming
cites work: Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization
cites work: Q4347616
cites work: Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces
cites work: On the Convergence of the Products of Firmly Nonexpansive Mappings
cites work: Q4894797
cites work: ESSENTIAL SMOOTHNESS, ESSENTIAL STRICT CONVEXITY, AND LEGENDRE FUNCTIONS IN BANACH SPACES
cites work: Bregman Monotone Optimization Algorithms
cites work: Totally convex functions for fixed points computation and infinite dimensional optimization
cites work: Dykstras algorithm with bregman projections: A convergence proof
cites work: Q4146094
cites work: Construction of best Bregman approximations in reflexive Banach spaces
cites work: Row-Action Methods for Huge and Sparse Systems and Their Applications
cites work: Block-Iterative Algorithms with Underrelaxed Bregman Projections
cites work: Q3679784
cites work: Q4490265
DOI: 10.1007/S10957-004-5723-2
description: scientific article; zbMATH DE number 2154321