-
Article
System of generalized nonlinear variational-like inclusions and fixed point problems: graph convergence with an application
In this paper, we are interested in the investigation of the problem of finding a common element of the set of fixed points of a total uniformly L-Lipschitzian map** and the set of solutions of a system of gene...
-
Article
Reaching Takahashi-type nonexpansive operators via modular structures with application to best proximity point
In this study, we introduce the concepts of modular Reich-type and modular Chatterjea-type nonexpansive map**s, as natural extensions of their definitions from normed vector spaces to modular vector spaces. ...
-
Article
System of generalized nonlinear variational-like inequalities and nearly asymptotically nonexpansive map**s: graph convergence and fixed point problems
In this paper, with the goal of investigating the problem of finding a common element of the set of fixed points of a nearly asymptotically nonexpansive map** and the set of solutions of a system of generali...
-
Article
Open AccessForward–backward splitting algorithm for fixed point problems and zeros of the sum of monotone operators
In this paper, we construct a forward–backward splitting algorithm for approximating a zero of the sum of an \(\alpha \)α-inverse strongly monotone operator and a maximal monotone operator. The strong convergence...
-
Article
Open AccessGlobally convergent method for designing twice spline contractual function
To design a quadratic spline contractual function in the case of discretely unknown nodes, a modified constraint shifting homotopy algorithm for solving principal–agent problems is constructed in the paper. Th...
-
Article
Open AccessApproximating distance between sets by multivalued coupling with application to uniformly convex Banach spaces
In this paper, our aim is to ascertain the distance between two sets iteratively in two simultaneous ways with the help of a multivalued coupling define for this purpose. We define the best proximity points of...
-
Article
Hybrid Proximal Point Algorithm and Applications to Equilibrium Problems and Convex Programming
In this paper, a hybrid projection algorithm for a countable family of map**s is considered in Banach spaces. The sequence generated by algorithm converges strongly to the common fixed point of the map**s....
-
Article
Construction algorithms for a class of monotone variational inequalities
This paper is devoted to solve the following monotone variational inequality of finding \(x^*\in \mathrm{Fix}(T)\) ...
-
Article
Open AccessOn multiplicative metric spaces: survey
The purpose of this survey is to prove that the fixed point results for various multiplicative contractions are in fact equivalent to the corresponding fixed point results in (standard) metric spaces. For exam...
-
Article
Open AccessThe Banach contraction principle in \(C^{*}\) -algebra-valued b-metric spaces with application
We introduce the notion of a C ∗ ...
-
Article
Open AccessA comparative study on the convergence rate of some iteration methods involving contractive map**s
We compare the rate of convergence for some iteration methods for contractions. We conclude that the coefficients involved in these methods have an important role to play in determining the speed of the conver...
-
Article
Open AccessA discussion on best proximity point and coupled best proximity point in partially ordered metric spaces
In this paper we establish some best proximity point results using generalized weak contractions with discontinuous control functions. The theorems are established in metric spaces with a partial order. We vie...
-
Article
Open AccessConvergence theorems for generalized nonexpansive map**s in uniformly convex Banach spaces
In this paper, we prove strong and weak convergence theorems for a map** defined on a bounded, closed and convex subset of a uniformly convex Banach space, satisfying the RCSC condition. This condition was i...
-
Article
Open AccessModified Picard-Mann hybrid iteration process for total asymptotically nonexpansive map**s
In this paper, using the modified hybrid Picard-Mann iteration process, we establish Δ-convergence and strong convergence theorems for total asymptotically nonexpansive map**s on a
-
Article
Open AccessConvergence of three-step iterations for nearly asymptotically nonexpansive map**s in \(\operatorname{CAT}(k)\) spaces
In this paper, we study strong and △-convergence of a newly defined three-step iteration process for nearly asymptotically nonexpansive map**s in the setting of
-
Article
Open AccessNew iteration process for pseudocontractive map**s with convergence analysis
In this study, we introduce a three step iteration process and prove a convergence result for a countable family of pseudocontractive map**s. Our results improve and generalize most of the results that have ...
-
Article
Open AccessStrong and △-convergence theorems for two asymptotically nonexpansive map**s in the intermediate sense in \(\operatorname{CAT}(0)\) spaces
In this paper, we study strong and △-convergence for a newly defined two-step iteration process involving two asymptotically nonexpansive map**s in the intermediate sense which is wider than the class of asy...
-
Article
Open AccessA hybrid iteration for asymptotically strictly pseudocontractive map**s
In this paper, we propose a new hybrid iteration for a finite family of asymptotically strictly pseudocontractive map**s. We also prove that such a sequence converges strongly to a common fixed point of a fi...
-
Article
Open AccessAlgorithms with strong convergence for the split common solution of the feasibility problem and fixed point problem
The purpose of this paper is to study the split feasibility problem and fixed point problem involved in the pseudocontractive map**s. We construct an iterative algorithm and prove its strong convergence.
-
Article
Open AccessNew iteration scheme for numerical reckoning fixed points of nonexpansive map**s
The purpose of this paper is to introduce a new three step iteration scheme for approximation of fixed points of the nonexpansive map**s. We show that our iteration process is faster than all of the Picard, ...
