Self-adaptive projection methods for the multiple-sets split feasibility problem
From MaRDI portal
Recommendations
- Self-adaptive and relaxed self-adaptive projection methods for solving the multiple-set split feasibility problem
- On two projection algorithms for the multiple-sets split feasibility problem
- A self-adaptive projection method for solving the multiple-sets split feasibility problem
- A simple projection method for solving the multiple-sets split feasibility problem
- Several acceleration schemes for solving the multiple-sets split feasibility problem
Cited in
(60)- Bounded perturbation resilience of extragradient-type methods and their applications
- An algorithm for the split-feasibility problems with application to the split-equality problem
- A parallel method for variational inequalities with the multiple-sets split feasibility problem constraints
- On two projection algorithms for the multiple-sets split feasibility problem
- An explicit method for the split feasibility problem with self-adaptive step sizes
- Self-adaptive and relaxed self-adaptive projection methods for solving the multiple-set split feasibility problem
- Two-step methods and relaxed two-step methods for solving the split equality problem
- General splitting methods with linearization for the split feasibility problem
- A Levenberg-Marquardt method for solving the tensor split feasibility problem
- An inertial extrapolation method for multiple-set split feasibility problem
- The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem
- The strong convergence of Douglas-Rachford methods for the split feasibility problem
- An inertial triple-projection algorithm for solving the split feasibility problem
- A relaxed self-adaptive projection algorithm for solving the multiple-sets split equality problem
- Strong convergence of a self-adaptive method for the split feasibility problem
- A family of projection gradient methods for solving the multiple-sets split feasibility problem
- Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
- A simple algorithm for computing projection onto intersection of finite level sets
- New inertial method for generalized split variational inclusion problems
- Hybrid CQ projection algorithm with line-search process for the split feasibility problem
- Self-adaptive algorithms for solving split feasibility problem with multiple output sets
- A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
- Algorithmic and analytical approach to the split common fixed points problem
- A simple projection method for solving the multiple-sets split feasibility problem
- Iterative methods for solving the multiple-sets split feasibility problem with splitting self-adaptive step size
- A Successive Projection Algorithm for Solving the Multiple-Sets Split Feasibility Problem
- Self-adaptive projection algorithms for solving the split equality problems
- Hybrid simultaneous algorithms for the split equality problem with applications
- Some subgradient extragradient type algorithms for solving split feasibility and fixed point problems
- A novel relaxed projective method for split feasibility problems
- A self-adaptive projection method for solving the multiple-sets split feasibility problem
- Hierarchical problems with applications to mathematical programming with multiple sets split feasibility constraints
- Strong convergence theorems for the split variational inclusion problem in Hilbert spaces
- Applications of fixed-point and optimization methods to the multiple-set split feasibility problem
- Several acceleration schemes for solving the multiple-sets split feasibility problem
- A new relaxed projection method to solve the multiple-sets split feasibility problem
- Modified alternating direction methods for the modified multiple-sets split feasibility problems
- A cyclic and simultaneous iterative method for solving the multiple-sets split feasibility problem
- Ball-relaxed projection algorithms for multiple-sets split feasibility problem
- A relaxed CQ algorithm involving the alternated inertial technique for the multiple-sets split feasibility problem
- Multiple-sets split quasi-convex feasibility problems: adaptive subgradient methods with convergence guarantee
- New self-adaptive algorithms and inertial self-adaptive algorithms for the split variational inclusion problems in Hilbert space
- Convergence analysis of an iterative method for solving multiple-set split feasibility problems in certain Banach spaces
- Iterative algorithms for finding minimum‐norm fixed point of nonexpansive mappings and applications
- A modified CQ algorithm for solving the multiple-sets split feasibility problem and the fixed point problem for nonexpansive mappings
- The double-relaxation modulus-based matrix splitting iteration method for linear complementarity problems
- An approximate gradient-type method for nonlinear symmetric equations with convex constraints
- A new inertial self-adaptive gradient algorithm for the split feasibility problem and an application to the sparse recovery problem
- New hybrid inertial CQ projection algorithms with line-search process for the split feasibility problem
- A novel projection method for split feasibility problems with applications to compressive sensing
- Second order self-adaptive dynamical system for sparse signal reconstruction and applications to image recovery
- Projection algorithms with adaptive step sizes for multiple output split mixed variational inequality problems
- On inertial non-Lipschitz stepsize algorithms for split feasibility problems
- An inertial hyperplane projection method for split feasibility problems and applications
- Pre-conditioning CQ algorithm for solving the split feasibility problem and its application to image restoration problem
- Two novel self-adaptive projection algorithms for split feasibility problems with multiple output sets
- An inertial conjugate gradient projection method for the split feasibility problem
- ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
- A unified relaxation method for tensor split feasibility problems on unions of sets
- Some remarks on the paper ``Strong convergence of a self-adaptive method for the split feasibility problem
This page was built for publication: Self-adaptive projection methods for the multiple-sets split feasibility problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3086010)
