Solving the multiple-set split feasibility problem and the equilibrium problem by a new relaxed CQ algorithm
From MaRDI portal
Publication:2657367
Recommendations
- A relaxed CQ algorithm involving the alternated inertial technique for the multiple-sets split feasibility problem
- A modified CQ algorithm for solving the multiple-sets split feasibility problem and the fixed point problem for nonexpansive mappings
- Strong convergence of a relaxed CQ algorithm for the split feasibility problem
- Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
- Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces
Cites work
- A note on the multiple-set split convex feasibility problem in Hilbert space
- A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
- A remark on vector-valued equilibria and generalized monotonicity
- A self-adaptive projection method for solving the multiple-sets split feasibility problem
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems
- An efficient simultaneous method for the constrained multiple-sets split feasibility problem
- An extrapolated iterative algorithm for multiple-set split feasibility problem
- Convergence theorems for inertial KM-type algorithms
- scientific article; zbMATH DE number 3853749 (Why is no real title available?)
- scientific article; zbMATH DE number 4021000 (Why is no real title available?)
- scientific article; zbMATH DE number 1090020 (Why is no real title available?)
- scientific article; zbMATH DE number 2182576 (Why is no real title available?)
- On two projection algorithms for the multiple-sets split feasibility problem
- Quasi-Fejérian analysis of some optimization algorithms
- Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
- Solving the split feasibility problem without prior knowledge of matrix norms
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- The multiple-sets split feasibility problem and its applications for inverse problems
- Three strong convergence theorems regarding iterative methods for solving equilibrium problems in reflexive Banach spaces
- Vector equilibrium problems with generalized monotone bifunctions
- Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
Cited in
(5)- An extended inertial Halpern-type ball-relaxed \(CQ\) algorithm for multiple-sets split feasibility problem
- Iterative process for solving a multiple-set split feasibility problem
- The strongly convergent relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces
- A relaxed CQ algorithm involving the alternated inertial technique for the multiple-sets split feasibility problem
- A modified CQ algorithm for solving the multiple-sets split feasibility problem and the fixed point problem for nonexpansive mappings
This page was built for publication: Solving the multiple-set split feasibility problem and the equilibrium problem by a new relaxed CQ algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2657367)
