Pages that link to "Item:Q2404495"

The following pages link to The regularized CQ algorithm without \textit{a priori} knowledge of operator norm for solving the split feasibility problem (Q2404495):

Displaying 10 items.

• Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem (Q962463) (← links)
• New inertial relaxed \(CQ\) algorithms for solving split feasibility problems in Hilbert spaces (Q2034949) (← links)
• New iterative regularization methods for the multiple-sets split feasibility problem (Q2223860) (← links)
• A new CQ algorithm for solving split feasibility problems in Hilbert spaces (Q2272641) (← links)
• Solving the split feasibility problem without prior knowledge of matrix norms (Q3168163) (← links)
• Weak, strong and linear convergence of the CQ-method via the regularity of Landweber operators (Q5217258) (← links)
• Convergence of Extrapolated Dynamic StringAveraging Cutter Methods and Applications (Q6110101) (← links)
• New hybrid inertial CQ projection algorithms with line-search process for the split feasibility problem (Q6158077) (← links)
• Extrapolated simultaneous block‐iterative cutter methods and applications (Q6185434) (← links)
• A first order dynamical system and its discretization for a class of variational inequalities (Q6664845) (← links)