Extra-gradient methods for solving split feasibility and fixed point problems

DOI10.1186/s13663-015-0441-zzbMath1346.47035OpenAlexW1844884171WikidataQ59436524 ScholiaQ59436524MaRDI QIDQ288119

Jin-Zuo Chen, Lu-Chuan Ceng, Zhao-Rong Kong, Yang-Qing Qiu

Publication date: 24 May 2016

Published in: Fixed Point Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s13663-015-0441-z

zbMATH Keywords

fixed point problemssplit feasibility problemspseudo-contractive mappingsextra-gradient methodsIshikawa-type iterative algorithmMann-type iterative algorithm

Mathematics Subject Classification ID

Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)

Related Items

The ball-relaxed gradient-projection algorithm for split feasibility problem ⋮ A new approach to solving split equality problems in Hilbert spaces ⋮ Convergence analysis of the shrinking approximants for fixed point problem and generalized split common null point problem ⋮ An inertial extragradient algorithm for split problems in Hilbert spaces ⋮ A modified Ishikawa iteration scheme for b‐enriched nonexpansive mapping to solve split variational inclusion problem and fixed point problem in Hilbert spaces ⋮ Global and linear convergence of alternated inertial methods for split feasibility problems ⋮ Strong convergence on the split feasibility problem by mixing \(W\)-mapping ⋮ Generalized extragradient iterative methods for solving split feasibility and fixed point problems in Hilbert spaces ⋮ The Strongly Convergent Relaxed Alternating CQ Algorithms for the Split Equality Problem in Hilbert Spaces

Cites Work

• Relaxed extragradient methods with regularization for general system of variational inequalities with constraints of split feasibility and fixed point problems
• Regularized methods for the split feasibility problem
• Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
• An extragradient method for solving split feasibility and fixed point problems
• Implicit and explicit algorithms for solving the split feasibility problem
• Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
• Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
• Strong convergence of an explicit iterative algorithm for continuous pseudo-contractions in Banach spaces
• A multiprojection algorithm using Bregman projections in a product space
• Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities
• Some modified extragradient methods for solving split feasibility and fixed point problems
• Strong convergence of a self-adaptive method for the split feasibility problem
• Algorithms with strong convergence for the split common solution of the feasibility problem and fixed point problem
• Weak convergence theorem by an extragradient method for nonexpansive mappings and monotone mappings
• Iterative methods for the split feasibility problem in infinite-dimensional 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
• Projection methods for variational inequalities with application to the traffic assignment problem
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Iterative oblique projection onto convex sets and the split feasibility problem
• The relaxed CQ algorithm solving the split feasibility problem
• Signal Recovery by Proximal Forward-Backward Splitting
• A note on the CQ algorithm for the split feasibility problem
• Several solution methods for the split feasibility problem
• Unnamed Item