An extrapolated iterative algorithm for multiple-set split feasibility problem

DOI10.1155/2012/149508zbMath1243.49040WikidataQ58694933 ScholiaQ58694933MaRDI QIDQ437508

Yan Gao, Ya-Zheng Dang

Publication date: 18 July 2012

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

Full work available at URL: https://doi.org/10.1155/2012/149508

zbMATH Keywords

multiple-set split feasibility problem (MSSFP)

Mathematics Subject Classification ID

90C25: Convex programming

Related Items

An explicit method for the split feasibility problem with self-adaptive step sizes, Iterative process for solving a multiple-set split feasibility problem, Solving the multiple-set split feasibility problem and the equilibrium problem by a new relaxed CQ algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
• A multiprojection algorithm using Bregman projections in a product space
• Extrapolation algorithm for affine-convex feasibility problems
• The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
• 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
• Decomposition through formalization in a product space
• Iterative oblique projection onto convex sets and the split feasibility problem
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• The relaxed CQ algorithm solving the split feasibility problem