Existence and convergence theorems for Bregman best proximity points in reflexive Banach spaces
From MaRDI portal
Publication:1742559
DOI10.1007/s11784-018-0509-6zbMath1491.47046OpenAlexW2794181428MaRDI QIDQ1742559
Publication date: 11 April 2018
Published in: Journal of Fixed Point Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11784-018-0509-6
Bregman functionBregman distanceBregman best proximity pointBregman cyclic \(\varphi \)-contraction mappingBregman cyclic contraction mappingBregman proximal pair
Related Items
Cites Work
- Common best proximity point theorems: global minimization of some real-valued multi-objective functions
- On best proximity point theorems and fixed point theorems for \(p\)-cyclic hybrid self-mappings in Banach spaces
- Best proximity points: Global optimal approximate solutions
- Best proximity point theorems
- Fixed point theorems and convergence theorems for generalized nonspreading mappings in Banach spaces
- Existence and convergence of best proximity points
- Convergence and existence results for best proximity points
- An iterative row-action method for interval convex programming
- Approximate selections, best approximations, fixed points, and invariant sets
- Totally convex functions for fixed points computation and infinite dimensional optimization
- Best proximity point theorems for proximal cyclic contractions
- Bregman weak relatively nonexpansive mappings in Banach spaces
- Pythagorean property and best-proximity point theorems
- On fixed and best proximity points of cyclic \(C\)-contractions in probabilistic complete metric and Banach spaces
- Genericity in nonlinear analysis
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Construction of best Bregman approximations in reflexive Banach spaces
- Proximinal Retracts and Best Proximity Pair Theorems
- On Bregman Best Proximity Points in Banach Spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item