Solving the multiple-set split feasibility problem and the equilibrium problem by a new relaxed CQ algorithm

DOI10.1007/S12215-019-00458-5zbMath1461.65163OpenAlexW2981869826MaRDI QIDQ2657367

Kunrada Kankam, Nattawut Pholasa, Pittaya Srinak, Prasit Cholamjiak

Publication date: 12 March 2021

Published in: Rendiconti del Circolo Matemàtico di Palermo. Serie II (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12215-019-00458-5

zbMATH Keywords

Hilbert spaceequilibrium problembounded linear operatorweak and strong convergencemultiple-set split feasibility problemrelaxed CQ algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Iterative procedures involving nonlinear operators (47J25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An extrapolated iterative algorithm for multiple-set split feasibility problem
• An efficient simultaneous method for the constrained multiple-sets split feasibility problem
• Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces
• Convergence theorems for inertial KM-type algorithms
• Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
• Vector equilibrium problems with generalized monotone bifunctions
• A remark on vector-valued equilibria and generalized monotonicity
• Alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems
• On two projection algorithms for the multiple-sets split feasibility problem
• Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
• A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
• Three Strong Convergence Theorems Regarding Iterative Methods for Solving Equilibrium Problems in Reflexive Banach Spaces
• Solving the split feasibility problem without prior knowledge of matrix norms
• 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
• A self-adaptive projection method for solving the multiple-sets split feasibility problem
• Weak convergence of the sequence of successive approximations for nonexpansive mappings

This page was built for publication: Solving the multiple-set split feasibility problem and the equilibrium problem by a new relaxed CQ algorithm