Relaxed implicit extragradient-like methods for finding minimum-norm solutions of the split feasibility problem
From MaRDI portal
Publication:2863550
Recommendations
- Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
- Hybrid extragradient methods for finding minimum-norm solutions of split feasibility problems
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- An extragradient method for solving split feasibility and fixed point problems
- A strongly convergent method for the split feasibility problem
Cited in
(9)- Hybrid extragradient methods for finding minimum-norm solutions of split feasibility problems
- A unified scheme for solving split inclusions with applications
- Implicit and explicit algorithms for solving the split feasibility problem
- Strong convergence of modified algorithms based on the regularization for the constrained convex minimization problem
- Strong convergence of hybrid Bregman projection algorithm for split feasibility and fixed point problems in Banach spaces
- A modified Ishikawa iteration scheme for b‐enriched nonexpansive mapping to solve split variational inclusion problem and fixed point problem in Hilbert spaces
- Quasi-Inertial Tseng’s Extragradient Algorithms for Pseudomonotone Variational Inequalities and Fixed Point Problems of Quasi-Nonexpansive Operators
- An extragradient method for finding minimum-norm solution of the split equilibrium problem
- Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
This page was built for publication: Relaxed implicit extragradient-like methods for finding minimum-norm solutions of the split feasibility problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2863550)