The strong convergence of a KM-CQ-like algorithm for a split feasibility problem
From MaRDI portal
Publication:3074671
Recommendations
- The strong convergence of a three-step algorithm for the split feasibility problem
- Strong convergence of a relaxed CQ algorithm for the split feasibility problem
- Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces
- A new iterative algorithm for split solution problems of quasi-nonexpansive mappings
- Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces
Cited in
(91)- Algorithms for the split variational inequality problem
- Implicit and explicit algorithms for solving the split feasibility problem
- Convergence of the modified CQ algorithm and its application in split feasibility problem
- An implicit algorithm for the split fixed point and convex feasibility problems
- Ball-relaxed projection algorithms for multiple-sets split feasibility problem
- New algorithms designed for the split common fixed point problem of quasi-pseudocontractions
- The strong convergence theorems for split common fixed point problem of asymptotically nonexpansive mappings in Hilbert spaces
- A novel relaxed projective method for split feasibility problems
- New inertial method for generalized split variational inclusion problems
- A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
- Strong convergence theorems for the split variational inclusion problem in Hilbert spaces
- Regularized methods for the split feasibility problem
- An explicit method for the split feasibility problem with self-adaptive step sizes
- New self-adaptive step size algorithms for solving split variational inclusion problems and its applications
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- Modified subgradient extragradient algorithms for variational inequality problems and fixed point problems
- Hybrid CQ projection algorithm with line-search process for the split feasibility problem
- A new inertial self-adaptive gradient algorithm for the split feasibility problem and an application to the sparse recovery problem
- A new self-adaptive CQ algorithm with an application to the LASSO problem
- A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems
- Superimposed algorithms for the split equilibrium problems and fixed point problems
- Inertial iteration for split common fixed-point problem for quasi-nonexpansive operators
- STRONG CONVERGENCE OF A NEW HYBRID ALGORITHM FOR FIXED POINT PROBLEMS AND EQUILIBRIUM PROBLEMS
- New iterative method with inertial technique for split variational inclusion problem to classify TPACK level of pre-service mathematics teachers
- A new extragradient-type algorithm for the split feasibility problem
- Algorithmic and analytical approach to the split common fixed points problem
- Self-adaptive algorithms for proximal split feasibility problems and strong convergence analysis
- New hybrid inertial CQ projection algorithms with line-search process for the split feasibility problem
- Approximation of solutions of split inverse problem for multi-valued demi-contractive mappings in Hilbert spaces
- A modified CQ algorithm for solving the multiple-sets split feasibility problem and the fixed point problem for nonexpansive mappings
- Fast self-adaptive regularization iterative algorithm for solving split feasibility problem
- New inertial relaxed method for solving split feasibilities
- Hierarchical problems with applications to mathematical programming with multiple sets split feasibility constraints
- An implementable splitting algorithm for the _1-norm regularized split feasibility problem
- Relaxed two points projection method for solving the multiple-sets split equality problem
- An extrapolated iterative algorithm for multiple-set split feasibility problem
- The split common fixed point problem for quasi-total asymptotically nonexpansive uniformly Lipschitzian mappings. RETRACTED
- An Iterative Algorithm for Split Common Fixed-Point Problem for Demicontractive Mappings
- ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
- A new approximation method for finding common fixed points of families of demicontractive operators and applications
- On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
- A new CQ algorithm for solving split feasibility problems in Hilbert spaces
- A perturbed projection algorithm with inertial technique for split feasibility problem
- Some remarks on the paper ``Strong convergence of a self-adaptive method for the split feasibility problem
- Hybrid simultaneous algorithms for the split equality problem with applications
- Hybrid steepest descent method for solving the split fixed point problem in Banach spaces
- A regularized algorithm for the proximal split feasibility problem
- New generalized variable stepsizes of the CQ algorithm for solving the split feasibility problem
- Adaptively relaxed algorithms for solving the split feasibility problem with a new step size
- Affine algorithms for the split variational inequality and equilibrium problems
- Inertial accelerated algorithms for solving a split feasibility problem
- A new simultaneous subgradient projection algorithm for solving a multiple-sets split feasibility problem.
- An inertial method for solving split common fixed point problems
- Strong convergence of a self-adaptive method for the split feasibility problem
- Viscosity self-adaptive method for generalized split system of variational inclusion problem
- Convergence analysis for proximal split feasibility problems and fixed point problems
- The split common fixed point problem for infinite families of total quasi-asymptotically nonexpansive operators
- Iterative algorithms for the split problem and its convergence analysis
- Hybrid iterative algorithms for the split common fixed point problems
- Variable KM-like algorithms for fixed point problems and split feasibility problems
- The common solutions of the split feasibility problems and fixed point problems
- The regularized CQ algorithm without \textit{a priori} knowledge of operator norm for solving the split feasibility problem
- Iterative process for solving a multiple-set split feasibility problem
- Convergence analysis of an iterative method for solving multiple-set split feasibility problems in certain Banach spaces
- Modified general splitting method for the split feasibility problem
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Bi-extrapolated subgradient projection algorithm for solving multiple-sets split feasibility problem
- General split feasibility problems in Hilbert spaces
- Two iterative algorithms for solving the split common fixed point problems
- Damped algorithms for the split fixed point and equilibrium problems
- Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces
- Iterative algorithms for the multiple-sets split feasibility problem in Hilbert spaces
- An algorithm for the split-feasibility problems with application to the split-equality problem
- General algorithms for split common fixed point problem of demicontractive mappings
- Strong convergence theorem for multiple sets split feasibility problems in Banach spaces
- A strongly convergent method 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
- Convergence analysis of a new iterative algorithm for solving split variational inclusion problems
- The strong convergence of a three-step algorithm for the split feasibility problem
- Two strongly convergent CQ algorithms for split feasibility problem
- Algorithms with strong convergence for the split common solution of the feasibility problem and fixed point problem
- Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces
- The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem
- Iterative regularization methods for the multiple-sets split feasibility problem in Hilbert spaces
- Some subgradient extragradient type algorithms for solving split feasibility and fixed point problems
- Global and linear convergence of alternated inertial methods for split feasibility problems
- Iterative algorithms for finding minimum‐norm fixed point of nonexpansive mappings and applications
- Accelerated subgradient extragradient methods for variational inequality problems
- New proximal type algorithms for convex minimization and its application to image deblurring
- Applications of fixed-point and optimization methods to the multiple-set split feasibility problem
This page was built for publication: The strong convergence of a KM-CQ-like algorithm for a split feasibility problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3074671)
