In the setting of Hilbert spaces, we show that a hybrid steepest-descent algorithm converges
strongly to a solution of a convex minimization problem over the fixed point set of a finite …

In this paper, we posit a framework for the investigation of the fixed point problems (FPP)
involving an infinite family of k-demicontractive operators and the split common null point …

In this paper, we consider an accelerated shrinking projection based parallel hybrid
algorithm to study the split null point problem (SNPP) associated with the maximal monotone …

This paper provides convergence analysis of some variants of the hybrid extragradient
algorithm (HEA) in Hilbert spaces. We employ the HEA to compute the common solution of …

In this paper, we examine the convergence analysis of a variant of Tseng's splitting method
for monotone inclusion problem and fixed point problem associated with an infinite family of …

This paper provides iterative construction of a common solution associated with the fixed
point problem of an infinite family of|-demicontractive mappings, pseudomonotone …

We propose and analyze a hybrid splitting method, comprises of forward-backward-forward
iterates, shrinking projection iterates and Nesterov's acceleration method, to solve the …

Within the context of Hilbert spaces, we demonstrate the robust convergence of a hybrid
steepest-descent approximant towards a solution for a convex minimization problem. This …