On descent-projection method for solving the split feasibility problems
From MaRDI portal
Publication:1928313
Recommendations
- A new iterative method for the split feasibility problem
- A splitting-relaxed projection method for solving the split feasibility problem
- A new halfspace-relaxation projection method for the split feasibility problem
- Projection algorithm for split feasibility problem
- A projection method for solving the sparsity split feasibility problem
Cites work
- scientific article; zbMATH DE number 3855514 (Why is no real title available?)
- scientific article; zbMATH DE number 3441150 (Why is no real title available?)
- scientific article; zbMATH DE number 3200865 (Why is no real title available?)
- A multiprojection algorithm using Bregman projections in a product space
- A new halfspace-relaxation projection method for the split feasibility problem
- A note on the CQ algorithm for the split feasibility problem
- A relaxed projection method for variational inequalities
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Convex Analysis
- Extended general variational inequalities
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- General variational inequalities
- Implicit and explicit algorithms for solving the split feasibility problem
- Improvements of some projection methods for monotone nonlinear variational inequalities
- Iterative oblique projection onto convex sets and the split feasibility problem
- Minimization of unsmooth functionals
- On some optimization techniques in image reconstruction from projections
- On variable-step relaxed projection algorithm for variational inequalities
- Some aspects of variational inequalities
- Some developments in general variational inequalities
- The relaxed CQ algorithm solving the split feasibility problem
Cited in
(14)- A dynamical system method for solving the split convex feasibility problem
- Iterative algorithms for solving the split feasibility problem in Hilbert spaces
- On inertial non-Lipschitz stepsize algorithms for split feasibility problems
- Adaptively relaxed algorithms for solving the split feasibility problem with a new step size
- Algorithms with new parameter conditions for split variational inclusion problems in Hilbert spaces with application to split feasibility problem
- A subgradient algorithm for a class of nonlinear split feasibility problems: application to jointly constrained Nash equilibrium models
- A new fixed-time stability of neural network to solve split convex feasibility problems
- A preconditioning method of the CQ algorithm for solving an extended split feasibility problem
- Gradient projection method with a new step size for the split feasibility problem
- An algorithm for the split-feasibility problems with application to the split-equality problem
- ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
- Successive linear programming approach for solving the nonlinear split feasibility problem
- New generalized variable stepsizes of the CQ algorithm for solving the split feasibility problem
- New strong convergence theorems for split variational inclusion problems in Hilbert spaces
This page was built for publication: On descent-projection method for solving the split feasibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928313)
