A splitting-relaxed projection method for solving the split feasibility problem
From MaRDI portal
Recommendations
- The relaxed CQ algorithm solving the split feasibility problem
- Strong convergence of a relaxed CQ algorithm for the split feasibility problem
- The ball-relaxed CQ algorithms for the split feasibility problem
- A new halfspace-relaxation projection method for the split feasibility problem
- Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
Cited in
(37)- On descent-projection method for solving the split feasibility problems
- Analysis on Newton projection method for the split feasibility problem
- General splitting methods with linearization for the split feasibility problem
- New inertial relaxed CQ algorithms for solving split feasibility problems in Hilbert spaces
- A Levenberg-Marquardt method for solving the tensor split feasibility problem
- Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
- A new \(CQ\) method for solving split feasibility problem
- The regularized CQ algorithm without \textit{a priori} knowledge of operator norm for solving the split feasibility problem
- Preconditioning methods for solving a general split feasibility problem
- A new halfspace-relaxation projection method for the split feasibility problem
- A dynamical system method for solving the split convex feasibility problem
- Semidefinite relaxation algorithm for solving tensor split feasibility problem
- Extensions of the CQ algorithm for the split feasibility and split equality problems
- scientific article; zbMATH DE number 7399383 (Why is no real title available?)
- Projection methods for the linear split feasibility problems
- A new algorithm for the split feasibility problem
- Strong convergence of a relaxed CQ algorithm for the split feasibility problem
- Iterative oblique projection onto convex sets and the split feasibility problem
- An unconstrained optimization approach to the split feasibility problem
- The ball-relaxed CQ algorithms for the split feasibility problem
- The relaxed CQ algorithm solving the split feasibility problem
- A relaxed projection method for split variational inequalities
- An inertial relaxed CQ algorithm with an application to the LASSO and elastic net
- scientific article; zbMATH DE number 7621497 (Why is no real title available?)
- On the convergence of CQ algorithm with variable steps for the split equality problem
- The selective projection method for convex feasibility and split feasibility problems
- Strongly convergent ball-relaxed CQ algorithm and its application
- The semi-algebraic split feasibility problem and its semi-definite relaxation
- Successive linear programming approach for solving the nonlinear split feasibility problem
- Convergence of the projected surrogate constraints method for the linear split feasibility problems
- Several solution methods for the split feasibility problem
- The relaxed inexact projection methods for the split feasibility problem
- A new relaxed method for the split feasibility problem in Hilbert spaces
- Convergence analysis of a new relaxed algorithm with inertial for solving split feasibility problems
- A moving ball projection algorithm for the split feasibility problem
- A novel relaxed method for the split feasibility problem in Hilbert spaces
- A new relaxed projection method for solving the split feasibility problem with multiple output sets
This page was built for publication: A splitting-relaxed projection method for solving the split feasibility problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2871112)
