A relaxed CQ algorithm involving the alternated inertial technique for the multiple-sets split feasibility problem
From MaRDI portal
Publication:5052602
Recommendations
- Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
- The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem
- scientific article; zbMATH DE number 7399383
- Solving the multiple-set split feasibility problem and the equilibrium problem by a new relaxed CQ algorithm
- Improved relaxed CQ method with inertial accelerated technique for the split feasibility problem
Cites work
- A note on the CQ algorithm for the split feasibility problem
- A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
- A subgradient extragradient algorithm with inertial effects for solving strongly pseudomonotone variational inequalities
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
- Convex analysis and monotone operator theory in Hilbert spaces
- scientific article; zbMATH DE number 7347501 (Why is no real title available?)
- scientific article; zbMATH DE number 7282700 (Why is no real title available?)
- Iterative methods for solving the multiple-sets split feasibility problem with splitting self-adaptive step size
- Iterative methods for solving variational inequality problems with a double-hierarchical structure in Hilbert spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- New inertial relaxed method for solving split feasibilities
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- On variable-step relaxed projection algorithm for variational inequalities
- Self-adaptive and relaxed self-adaptive projection methods for solving the multiple-set split feasibility problem
- Self-adaptive projection methods for the multiple-sets split feasibility problem
- Solving the split feasibility problem without prior knowledge of matrix norms
- Some methods of speeding up the convergence of iteration methods
- Strongly convergent inertial extragradient type methods for equilibrium problems
- The multiple-sets split feasibility problem and its applications for inverse problems
- The relaxed CQ algorithm solving the split feasibility problem
Cited in
(8)- Note on the modified relaxation CQ algorithm for the split feasibility problem
- The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem
- 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
- Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
- Solving the multiple-set split feasibility problem and the equilibrium problem by a new relaxed CQ algorithm
- A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
- Algorithms for split equality variational inequality and fixed point problems
This page was built for publication: A relaxed CQ algorithm involving the alternated inertial technique 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 Q5052602)
