Pages that link to "Item:Q721148"

The following pages link to ``Optimal'' choice of the step length of the projection and contraction methods for solving the split feasibility problem (Q721148):

Displayed 30 items.

• The combination projection method for solving convex feasibility problems (Q1634718) ‎ (← links)
• General splitting methods with linearization for the split feasibility problem (Q2022289) ‎ (← links)
• Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces (Q2035511) ‎ (← links)
• New inertial relaxed method for solving split feasibilities (Q2047200) ‎ (← links)
• Explicit extragradient-like method with adaptive stepsizes for pseudomonotone variational inequalities (Q2047206) ‎ (← links)
• The iterative method for solving the proximal split feasibility problem with an application to LASSO problem (Q2064973) ‎ (← links)
• Some algorithms for classes of split feasibility problems involving paramonotone equilibria and convex optimization (Q2067797) ‎ (← links)
• An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces (Q2142548) ‎ (← links)
• A relaxed projection method using a new linesearch for the split feasibility problem (Q2146639) ‎ (← links)
• An explicit extragradient algorithm for solving variational inequalities (Q2178887) ‎ (← links)
• A new strong convergence for solving split variational inclusion problems (Q2220740) ‎ (← links)
• Global and linear convergence of alternated inertial methods for split feasibility problems (Q2222846) ‎ (← links)
• A self-adaptive iterative algorithm for the split common fixed point problems (Q2334815) ‎ (← links)
• Fixed points of nonlinear contractions with applications (Q2671010) ‎ (← links)
• Inertial projection and contraction methods for split feasibility problem applied to compressed sensing and image restoration (Q2673529) ‎ (← links)
• A method with inertial extrapolation step for split monotone inclusion problems (Q4986401) ‎ (← links)
• A new self-adaptive method for the split equality common fixed-point problem of quasi-nonexpansive mappings (Q4986404) ‎ (← links)
• Two projection algorithms for a class of split feasibility problems with jointly constrained Nash equilibrium models (Q4986408) ‎ (← links)
• Ball-relaxed projection algorithms for multiple-sets split feasibility problem (Q5045171) ‎ (← links)
• A double projection algorithm with inertial effects for solving split feasibility problems and applications to image restoration (Q5058171) ‎ (← links)
• A new iterative method with alternated inertia for the split feasibility problem (Q5090003) ‎ (← links)
• (Q5121081) ‎ (← links)
• Gradient methods with selection technique for the multiple-sets split feasibility problem (Q5213370) ‎ (← links)
• Proximal type algorithms involving linesearch and inertial technique for split variational inclusion problem in hilbert spaces with applications (Q5238201) ‎ (← links)
• Inertial relaxed CQ algorithm for split feasibility problems with non-Lipschitz gradient operators (Q6042226) ‎ (← links)
• An alternated inertial general splitting method with linearization for the split feasibility problem (Q6048271) ‎ (← links)
• Two inertial-type algorithms for solving the split feasibility problem (Q6048274) ‎ (← links)
• Alternated inertial algorithms for split feasibility problems (Q6140898) ‎ (← links)
• A strongly convergent viscosity-type inertial algorithm with self adaptive stepsize for solving split variational inclusion problems in Hilbert spaces (Q6146887) ‎ (← links)
• A dynamic simultaneous algorithm for solving split equality fixed point problems (Q6151642) ‎ (← links)