An implicit algorithm for the split fixed point and convex feasibility problems

DOI10.1155/2013/854893zbMath1470.65116OpenAlexW1996630894WikidataQ58917623 ScholiaQ58917623MaRDI QIDQ2319203

Fengjun Guo, Young-Chel Kwun, Kang, Shin Min

Publication date: 16 August 2019

Published in: Abstract and Applied Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/854893

Mathematics Subject Classification ID

Convex programming (90C25) Numerical optimization and variational techniques (65K10) Iterative procedures involving nonlinear operators (47J25) Iterative numerical methods for linear systems (65F10) Numerical solution to inverse problems in abstract spaces (65J22)

Cites Work

• Unnamed Item
• Unnamed Item
• Mann type iterative methods for finding a common solution 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
• A multiprojection algorithm using Bregman projections in a product space
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
• A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
• Iterative oblique projection onto convex sets and the split feasibility problem
• The relaxed CQ algorithm solving the split feasibility problem
• Several solution methods for the split feasibility problem

This page was built for publication: An implicit algorithm for the split fixed point and convex feasibility problems