A perturbed projection algorithm with inertial technique for split feasibility problem

DOI10.1155/2012/207323MaRDI QIDQ442823zbMATH OpenOpenAlexWikidataFDO

Authors Yanli Han, Yan Gao, Yazheng Dang

Publication date 6 August 2012

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

Copyright license Creative Commons Attribution 4.0 International

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)

Recommendations

• Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
• An inertial triple-projection algorithm for solving the split feasibility problem
• Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces
• Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
• Convergence analysis of an inertial iterate for the proximal split feasibility problem

Cites work

• scientific article; zbMATH DE number 2042705 (Why is no real title available?)
• scientific article; zbMATH DE number 3893867 (Why is no real title available?)
• A logarithmic-quadratic proximal method for variational inequalities
• A multiprojection algorithm using Bregman projections in a product space
• A projection algorithm for general variational inequalities with perturbed constraint sets
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Convergence of a splitting inertial proximal method for monotone operators
• Convergence theorems for inertial KM-type algorithms
• Inertial iterative process for fixed points of certain quasi-nonexpansive mappings
• Iterative oblique projection onto convex sets and the split feasibility problem
• On Projection Algorithms for Solving Convex Feasibility Problems
• Several solution methods for the split feasibility problem
• The strong convergence of a KM-CQ-like algorithm for a split feasibility problem
• Weak convergence of the sequence of successive approximations for nonexpansive mappings

Cited in

(6)

• Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
• An explicit method for the split feasibility problem with self-adaptive step sizes
• Inertial iteration for split common fixed-point problem for quasi-nonexpansive operators
• Two inertial-type algorithms for solving the split feasibility problem
• Iterative process for solving a multiple-set split feasibility problem
• Convergence analysis for the proximal split feasibility problem using an inertial extrapolation term method

This page was built for publication: A perturbed projection algorithm with inertial technique for split feasibility problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442823)