A perturbed projection algorithm with inertial technique for split feasibility problem

DOI10.1155/2012/207323zbMath1256.65052OpenAlexW2090021378WikidataQ58906382 ScholiaQ58906382MaRDI QIDQ442823

Yanli Han, Yan Gao, Ya-Zheng Dang

Publication date: 6 August 2012

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

split feasibility problemasymptotic convergenceperturbed projection algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items

Convergence analysis for the proximal split feasibility problem using an inertial extrapolation term method ⋮ An explicit method for the split feasibility problem with self-adaptive step sizes ⋮ Iterative process for solving a multiple-set split feasibility problem ⋮ Inertial iteration for split common fixed-point problem for quasi-nonexpansive operators

Cites Work

• Unnamed Item
• Unnamed Item
• Inertial iterative process for fixed points of certain quasi-nonexpansive mappings
• Convergence theorems for inertial KM-type algorithms
• A projection algorithm for general variational inequalities with perturbed constraint sets
• A logarithmic-quadratic proximal method for variational inequalities
• A multiprojection algorithm using Bregman projections in a product space
• Convergence of a splitting inertial proximal method for monotone operators
• The strong convergence of a KM–CQ-like algorithm for a 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
• On Projection Algorithms for Solving Convex Feasibility Problems
• Weak convergence of the sequence of successive approximations for nonexpansive mappings
• Several solution methods for the split feasibility problem