carpathian_2018_34_2_199_206_abstractcarpathian_2018_34_2_199_206In this paper best random proximity points equations have been proved. As a result best random proximity points and best random 
-proximity points have been proposed with the help of new generalized notions. These are generalizations of random fixed point theorems. Also, the concept of random best -proximity points has also be proposed in this work and corresponding theorems are also defined here.
| Author(s) | Komal, Somayya, Kumam, Poom |
|---|---|
| DOI | https://doi.org/10.37193/CJM.2018.02.08 |
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
