A self-adaptive iterative algorithm for the split common fixed point problems

DOI10.1007/s11075-018-0640-xOpenAlexW2903674759WikidataQ128830465 ScholiaQ128830465MaRDI QIDQ2334815

Jing Zhao, Dingfang Hou

Publication date: 8 November 2019

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-018-0640-x

zbMATH Keywords

iterative algorithmweak convergenceHilbert spacesplit common fixed-point problemaveraged mappingdual variable

Mathematics Subject Classification ID

Equations involving nonlinear operators (general) (47J05) Fixed-point theorems (47H10) Fixed-point and coincidence theorems (topological aspects) (54H25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)

Related Items

Weak and strong convergence adaptive algorithms for generalized split common fixed point problems ⋮ Convergence analysis of new inertial method for the split common null point problem ⋮ Accelerated cyclic iterative algorithms for the multiple-set split common fixed-point problem of quasi-nonexpansive operators ⋮ A new self-adaptive accelerated method for generalized split system of common fixed-point problem of averaged mappings ⋮ An accelerate algorithm for the split equality common fixed-point problem of directed operators ⋮ An Approach for Solving Split Common Fixed Point Problems with Multiple Output Sets That Uses Dynamic Step Sizes ⋮ A self-adaptive relaxed primal-dual iterative algorithm for solving the split feasibility and the fixed point problem ⋮ Inertial methods for finding minimum-norm solutions of the split variational inequality problem beyond monotonicity ⋮ A novel low-cost method for generalized split inverse problem of finite family of demimetric mappings ⋮ Iterative methods for fixed points and zero points of nonlinear mappings with applications ⋮ A new self-adaptive method for the split equality common fixed-point problem of quasi-nonexpansive mappings ⋮ Two inertial subgradient extragradient algorithms for variational inequalities with fixed-point constraints ⋮ Inertial accelerated algorithms for the split common fixed-point problem of directed operators ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weak- and strong-convergence theorems of solutions to split feasibility problem for nonspreading type mapping in Hilbert spaces
• Shrinking projection methods for solving split equilibrium problems and fixed point problems for asymptotically nonexpansive mappings in Hilbert spaces
• Self-adaptive algorithms for proximal split feasibility problems and strong convergence analysis
• On the convergence of CQ algorithm with variable steps for the split equality problem
• A note on the split common fixed-point problem for quasi-nonexpansive operators
• Algorithms for the split variational inequality problem
• Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
• ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
• A multiprojection algorithm using Bregman projections in a product space
• Strong convergence of an iterative method for solving the multiple-set split equality fixed point problem in a real Hilbert space
• Split common null point and common fixed point problems between Banach spaces and Hilbert spaces
• A new method for split common fixed-point problem without priori knowledge of operator norms
• A fixed point method for solving a split feasibility problem in Hilbert spaces
• On variable-step relaxed projection algorithm for variational inequalities
• The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
• General method for solving the split common fixed point problem
• Adaptively relaxed algorithms for solving the split feasibility problem with a new step size
• The extragradient algorithm with inertial effects for solving the variational inequality
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• Solving the split feasibility problem without prior knowledge of matrix norms
• A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
• Solving split equality fixed-point problem of quasi-nonexpansive mappings without prior knowledge of operators norms
• A self-adaptive projection method for solving the multiple-sets split feasibility 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 Split Common Null Point Problem
• On Projection Algorithms for Solving Convex Feasibility Problems
• A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
• Viscosity Approximation Methods for Split Common Fixed-Point Problem of Directed Operators
• A note on the CQ algorithm for the split feasibility problem

This page was built for publication: A self-adaptive iterative algorithm for the split common fixed point problems