Extensions of the CQ algorithm for the split feasibility and split equality problems
From MaRDI portal
Publication:3382964
zbMATH Open1470.65050MaRDI QIDQ3382964FDOQ3382964
Authors: Abdellatif Moudafi, Charles Byrne
Publication date: 22 September 2021
Full work available at URL: http://www.yokohamapublishers.jp/online2/opjnca/vol18/1485.html
Recommendations
- The relaxed CQ algorithm solving the split feasibility problem
- A splitting-relaxed projection method for solving the split feasibility problem
- Modified projection methods for the split feasibility problem and the multiple-sets 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
Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26) Iterative numerical methods for linear systems (65F10) Convexity of real functions of several variables, generalizations (26B25)
Cited In (27)
- Gradient projection method with a new step size for the split feasibility problem
- Solving the multiple-set split equality common fixed-point problem of firmly quasi-nonexpansive operators
- Self-adaptive-type CQ algorithms for split equality problems
- The general split equality problem for Bregman quasi-nonexpansive mappings in Banach spaces
- A new self-adaptive method for the split equality common fixed-point problem of quasi-nonexpansive mappings
- A new simultaneous iterative method with a parameter for solving the extended split equality problem and the extended split equality fixed point problem
- General split equality problems in Hilbert spaces
- Iterative algorithm for the split equality problem in Hilbert spaces
- A new parallel algorithm for solving a class of variational inequalities
- Strong convergence theorems for split inclusion problems in Hilbert spaces
- Hybrid simultaneous algorithms for the split equality problem with applications
- Approximating solutions of split equality of some nonlinear optimization problems using an inertial algorithm
- An inertial iterative algorithm for approximating common solutions to split equalities of some nonlinear optimization problems
- Relaxed inertial accelerated algorithms for solving split equality feasibility problem
- Convergence rate of the relaxed CQ algorithm under Hölderian type error bound property
- Strong convergence of an iterative method for solving the multiple-set split equality fixed point problem in a real Hilbert space
- A cyclic iterative method for solving the system of split equality zero-point problems
- An algorithm for the split-feasibility problems with application to the split-equality problem
- Alternating iterative algorithms for the split equality problem without prior knowledge of operator norms
- Iterative approximation for split equality fixed point problem for family of multivalued mappings
- Simultaneous and semi-alternating projection algorithms for solving split equality problems
- A semi-alternating algorithm for solving nonconvex split equality problems
- Title not available (Why is that?)
- On the convergence of CQ algorithm with variable steps for the split equality problem
- The Landweber operator approach to the split equality problem
- Strong convergence of an extragradient-type algorithm for the multiple-sets split equality problem
- The ball-relaxed CQ algorithms for the split feasibility problem
This page was built for publication: Extensions of the CQ algorithm for the split feasibility and split equality problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3382964)