The purpose of this paper is to introduce a new hybrid algorithm for finding a global minimization of best proximity points for a new class of mappings, called best proximally nonexpansive (BPNE), which is weaker than nonself nonexpansive mappings and then prove strong convergence of the proposed method under some suitable conditions in real Hilbert spaces. Finally, some numerical experiment is also given for demonstrating our main result.
A new hybrid algorithm for global minimization of best proximity points in Hilbert spaces
Suparatulatorn, Raweerote and Suantai, Suthep
Abstract
carpathian_2019_35_1_95_102_abstractFull PDF
carpathian_2019_35_1_95_102Additional Information
| Author(s) | Suantai, Suthep, Suparatulatorn, Raweerote |
|---|---|
| DOI | https://doi.org/10.37193/CJM.2019.01.11 |
Recently posted
-
Weak and Strong Convergence of Split Douglas-Rachford Algorithms for Monotone Inclusions
-
Fixed point theorems for basic θ-contraction and applications
-
A Fast Forward-Backward Algorithm Using Linesearch and Inertial Techniques for Convex Bi-level Optimization Problems with Applications
-
Convergence of self-adaptive Tseng-type algorithms for split variational inequalities and fixed point problems
-
A fast contraction algorithm using two inertial extrapolations for variational inclusion problem and data classification
-
Periodic cycles for an extension of generalized 3x + 1 functions
-
Some remarks on expansive mappings in metric spaces
-
Asymptotically α hemicontractive mappings in Hilbert spaces and a new algorithm for solving associated split common fixed point problem
-
Extreme solution for fractional differential equation with nonlinear boundary condition
-
Generalized Split Feasibility Problem: Solution by Iteration