Two projection algorithms for solving the split common fixed point problem

DOI10.1007/s10957-020-01702-0OpenAlexW3037795422MaRDI QIDQ779863

Truong Minh Tuyen, Simeon Reich

Publication date: 14 July 2020

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-020-01702-0

zbMATH Keywords

Bregman projectionsplit common fixed point problemBregman distanceBregman relatively nonexpansive operator

Mathematics Subject Classification ID

Convex programming (90C25) Monotone operators and generalizations (47H05) Set-valued and variational analysis (49J53) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)

Related Items

Ball-relaxed projection algorithms for multiple-sets split feasibility problem ⋮ Convergence analysis of new inertial method for the split common null point problem ⋮ A Bregman subgradient extragradient method with self-adaptive technique for solving variational inequalities in reflexive Banach spaces ⋮ Accelerated cyclic iterative algorithms for the multiple-set split common fixed-point problem of quasi-nonexpansive operators ⋮ Solving a general split equality problem without prior knowledge of operator norms in Banach spaces ⋮ Hierarchical variational inequality problem and split common fixed point of averaged operators ⋮ Self-adaptive algorithms for solving split feasibility problem with multiple output sets ⋮ Variational inequalities over the solution sets of split variational inclusion problems ⋮ 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 ⋮ Inertial projection and contraction methods for pseudomonotone variational inequalities with non-Lipschitz operators and applications ⋮ Projection algorithms for solving the split feasibility problem with multiple output sets ⋮ An inertial extrapolation method for multiple-set split feasibility problem ⋮ Self adaptive inertial relaxed \(CQ\) algorithms for solving split feasibility problem with multiple output sets ⋮ Unnamed Item ⋮ The split feasibility problem with multiple output sets for demicontractive mappings ⋮ Strong convergence of inertial projection and contraction methods for pseudomonotone variational inequalities with applications to optimal control problems

Cites Work

• An iterative algorithm for solving split feasibility problems and fixed point problems in Banach spaces
• Cyclic algorithms for split feasibility problems in Hilbert spaces
• Algorithms for the split variational inequality problem
• Two strong convergence theorems for Bregman strongly nonexpansive operators in reflexive Banach spaces
• An iterative row-action method for interval convex programming
• A multiprojection algorithm using Bregman projections in a product space
• Totally convex functions for fixed points computation and infinite dimensional optimization
• A strong convergence theorem for solving the split feasibility and fixed point problems in Banach spaces
• A strong convergence theorem for the split common null point problem in Banach spaces
• Forcing strong convergence of proximal point iterations in a Hilbert space
• A new algorithm for solving the split common null point problem in Hilbert spaces
• The split common null point problem in Banach spaces
• A shrinking projection method for solving the split common null point problem in Banach spaces
• Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces
• The split common null point problem and the shrinking projection method in Banach spaces
• Existence and Approximation of Fixed Points of Bregman Firmly Nonexpansive Mappings in Reflexive Banach Spaces
• Convergence theorems for Bregman strongly nonexpansive mappings in reflexive Banach spaces
• 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
• The split common fixed-point problem for demicontractive mappings
• Two Strong Convergence Theorems for a Proximal Method in Reflexive Banach Spaces
• Asymptotic Behavior of Relatively Nonexpansive Operators in Banach Spaces
• Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization
• Bregman Monotone Optimization Algorithms
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Iterative oblique projection onto convex sets and the split feasibility problem
• ESSENTIAL SMOOTHNESS, ESSENTIAL STRICT CONVEXITY, AND LEGENDRE FUNCTIONS IN BANACH SPACES
• The Split Common Null Point Problem
• The relaxed CQ algorithm solving the split feasibility problem
• Metric and Generalized Projection Operators in Banach Spaces: Properties and Applications
• Iterative methods for solving the generalized split common null point problem in Hilbert spaces
• Two projection methods for solving the multiple-set split common null point problem in Hilbert spaces
• A Proximal-Projection Method for Finding Zeros of Set-Valued Operators
• SHRINKING PROJECTION ALGORITHMS FOR THE SPLIT COMMON NULL POINT PROBLEM
• Level Sets and Continuity of Conjugate Convex Functions
• An Iteration Formula for Fredholm Integral Equations of the First Kind
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item