In addition, by introducing the Bregman iterative parameters (23a, 34) and Lagrangian multipliers (28a, 39), a relatively large time step can be used to speed up LSF evaluation.
Subsequently, Moudafi and Mainge [1] studied the explicit scheme for computing a solution of VIP (1.2) by introducing the following iterative algorithm: x n + 1 = λ n f ( x n ) + ( 1 − λ n ) ( α n S x n + ( 1 − α n ) T x n ), (1.3).
Peng et al. [25] introduced the iterative scheme by the viscosity approximation method for finding a common element of the set of solutions to the problem (1.8), the set of solutions of an equilibrium problem, and the set of fixed points of a nonexpansive mapping in a Hilbert space.
Recently, S. Takahashi and W. Takahashi [21] considered the problem (1.12) by introducing an iterative method in a Hilbert space.
In this paper, we propose an iterative group-based ranking method by introducing an iterative reputation allocation process into the original group-based ranking method.
In this article, we improve the method of [20] by introducing an iterative algorithm as follows.
In [16], the "dynamic filtering" is implemented by introducing an iterative re-weighted ℓ 1-norm penalty.
Cho and Lan [23] considered and studied a class of generalized nonlinear random (A, η -accretive equations with random relaxed cocoercive mappings in Banach spaces and by introducing some random iterative algorithms, they proved the convergence of iterative sequences generated by proposed algorithms.
By introducing a double iterative technique, in the case of the nonlinearity with singularity at time and space variables, the unique positive solution to the problem is established.
In this paper, by introducing a double iterative technique, we established the convergence analysis and error estimation for the unique solution of a p-Laplacian fractional differential equation with singular decreasing nonlinearity.
