Two strong convergence theorems for Bregman strongly nonexpansive operators in reflexive Banach spaces
DOI10.1016/j.na.2010.03.005zbMath1226.47089OpenAlexW2053619914MaRDI QIDQ975247
Publication date: 9 June 2010
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.na.2010.03.005
iterative algorithmstrong convergencevariational inequalitymonotone operatorBanach spaceequilibrium problemconvex feasibility problemBregman projectionBregman distanceLegendre functiontotally convex functionBregman firmly nonexpansive operatorBregman inverse strongly monotone operatorBregman strongly nonexpansive operator
Convex programming (90C25) Variational inequalities (49J40) Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
Related Items
Cites Work
- Convex functions, monotone operators and differentiability.
- An iterative row-action method for interval convex programming
- Iterative averaging of entropic projections for solving stochastic convex feasibility problems
- Totally convex functions for fixed points computation and infinite dimensional optimization
- Strong convergence theorems by hybrid methods for families of nonexpansive mappings in Hilbert spaces
- Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces
- Existence and Approximation of Fixed Points of Bregman Firmly Nonexpansive Mappings in Reflexive Banach Spaces
- Two Strong Convergence Theorems for a Proximal Method in Reflexive Banach Spaces
- A limit theorem for projections
- Monotone Operators and the Proximal Point Algorithm
- Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization
- Bregman Monotone Optimization Algorithms
- ESSENTIAL SMOOTHNESS, ESSENTIAL STRICT CONVEXITY, AND LEGENDRE FUNCTIONS IN BANACH SPACES
- On Projection Algorithms for Solving Convex Feasibility Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A Proximal-Projection Method for Finding Zeros of Set-Valued Operators
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item