Related papers: Weak convergence theorems for a symmetric generali…
In this paper, a general hybrid fixed point theorem for the contractive mappings in generalized Banach spaces is proved via measure of weak non-compactness and it is further applied to fractional integral equations for proving the existence…
We study the convergence analysis of a Picard-S iteration method for a particular class of weak-contraction mappings. Furthermore, we prove a data dependence result for fixed point of the class of weak-contraction mappings with the help of…
We establish common fixed point theorems for two pairs of weakly compatible self-mappings using an auxiliary function of two variables. Unlike classical results, our theorems do not assume continuity of the mappings and require completeness…
In this paper, we introduce a new method for solving variational inequality problems with monotone and Lipschitz-continuous mapping in Hilbert space. The iterative process is based on two well-known projection method and the hybrid (or…
In this paper, we establish some common fixed point results for two pairs of weakly compatible mappings in the setting of $C$-complex valued metric space. Also, as application of the proved result, we obtain the existence and uniqueness of…
We propose an inexact Uzawa algorithm with two variable relaxation parameters for solving the generalized saddle-point system. The saddle-point problems can be found in a wide class of applications, such as the augmented Lagrangian…
Variational regularisation is the primary method for solving inverse problems, and recently there has been considerable work leveraging deeply learned regularisation for enhanced performance. However, few results exist addressing the…
The paper investigates two inertial extragradient algorithms for seeking a common solution to a variational inequality problem involving a monotone and Lipschitz continuous mapping and a fixed point problem with a demicontractive mapping in…
We prove the existence of common fixed points for two weakly compatible mappings satisfying a 'generalized condition (B)'. This result generalizes some theorems of Al-Thagafi and Shahzad \cite{AlThagafi2006} and Babu, Sandhya and Kameswari…
This paper deals with the solving of variational inequality problem where the constrained set is given as the intersection of a number of fixed-point sets. To this end, we present an extrapolated sequential constraint method. At each…
Let $C$ be a nonempty closed and convex subset of a uniformly smooth and uniformly convex real Banach space $E$ with dual space $E^*$. We present a novel hybrid method for finding a common solution of a family of equilibrium problems, a…
In this paper, we introduce an inertial proximal method for solving a bilevel problem involving two monotone equilibrium bifunctions in Hilbert spaces. Under suitable conditions and without any restrictive assumption on the trajectories,…
This work focuses on convergence analysis of the projected gradient method for solving constrained convex minimization problem in Hilbert spaces. We show that the sequence of points generated by the method employing the Armijo linesearch…
In this paper we prove the strong convergence of the explicit iterative process to a common fixed point of the finite family of nonexpansive mappings defined on Hilbert space, which solves the the variational inequality on the fixed points…
We prove weak and strong convergence theorems for a double Krasnoselskij type iterative method to approximate coupled solutions of a bivariate nonexpansive operator F : C x C --> C, where C is a nonempty closed and convex subset of a…
This paper concerns models and convergence principles for dealing with stochasticity in a wide range of algorithms arising in nonlinear analysis and optimization in Hilbert spaces. It proposes a flexible geometric framework within which…
We establish a novel convergent iteration framework for a weak approximation of general switching diffusion. The key theoretical basis of the proposed approach is a restriction of the maximum number of switching so as to untangle and…
This study delves into equilibrium problems, focusing on the identification of finite solutions for feasible solution sequences. We introduce an innovative extension of the weak sharp minimum concept from convex programming to equilibrium…
In this paper, using sunny generalized nonexpansive retraction, we propose new extragradient and linesearch algorithms for finding a common element of the set of solutions of an equilibrium problem and the set of fixed points of a…
In this paper, we introduce some new hybrid algorithms for finding a solution of a system of equilibrium problems. In these algorithms, by constructing specially cutting-halfspaces, we avoid using the extra-steps as in the extragradient…