
doi: 10.3934/jimo.2021185
<p style='text-indent:20px;'>The paper proposes some new iterative algorithms for solving a split variational inclusion problem involving maximally monotone multi-valued operators in a Hilbert space. The algorithms are constructed around the resolvent of operator and the regularization technique to get the strong convergence. Some stepsize rules are incorporated to allow the algorithms to work easily. An application of the proposed algorithms to split feasibility problems is also studied. The computational performance of the new algorithms in comparison with others is shown by some numerical experiments.</p>
iterative method, split variational inclusion, Parallel numerical computation, split feasibility problem, Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming), regularization method, Numerical methods for variational inequalities and related problems
iterative method, split variational inclusion, Parallel numerical computation, split feasibility problem, Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming), regularization method, Numerical methods for variational inequalities and related problems
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
