A relaxed CQ algorithm involving the alternated inertial technique for the multiple-sets split feasibility problem
From MaRDI portal
Publication:5052602
DOI10.23952/JNVA.6.2022.4.02OpenAlexW4312595545MaRDI QIDQ5052602FDOQ5052602
Authors: Yaxuan Zhang, Yingying Li
Publication date: 25 November 2022
Published in: Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.23952/jnva.6.2022.4.02
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
- Convex analysis and monotone operator theory in Hilbert spaces
- The multiple-sets split feasibility problem and its applications for inverse problems
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Iterative oblique projection onto convex sets and the split feasibility problem
- On variable-step relaxed projection algorithm for variational inequalities
- Self-adaptive projection methods for the multiple-sets split feasibility problem
- Solving the split feasibility problem without prior knowledge of matrix norms
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- The relaxed CQ algorithm solving the split feasibility problem
- A note on the CQ algorithm for the 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
- Iterative methods for solving variational inequality problems with a double-hierarchical structure in Hilbert spaces
- Self-adaptive and relaxed self-adaptive projection methods for solving the multiple-set split feasibility problem
- Iterative methods for solving the multiple-sets split feasibility problem with splitting self-adaptive step size
- Some methods of speeding up the convergence of iteration methods
- A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- New inertial relaxed method for solving split feasibilities
- Title not available (Why is that?)
- A subgradient extragradient algorithm with inertial effects for solving strongly pseudomonotone variational inequalities
- Title not available (Why is that?)
- Strongly convergent inertial extragradient type methods for equilibrium problems
Cited In (6)
- A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
- An extended inertial Halpern-type ball-relaxed \(CQ\) algorithm for multiple-sets split feasibility problem
- Note on the modified relaxation CQ algorithm for the 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
- The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem
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)