Modified Hybrid Steepest Method for the Split Feasibility Problem in Image Recovery of Inverse Problems

DOI10.1080/01630563.2017.1287084zbMath1453.47016OpenAlexW2583668242WikidataQ59306842 ScholiaQ59306842MaRDI QIDQ5355192

Jitsupa Deepho, Kanokwan Sitthithakerngkiet, Poom Kumam

Publication date: 6 September 2017

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630563.2017.1287084

zbMATH Keywords

fixed pointvariational inequalityinverse problemsviscosity methodsplit feasibility problemconvex minimization problem\(CQ\) algorithmhybrid steepest methodimage recovery in Hilbert space

Mathematics Subject Classification ID

Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Applications of operator theory in systems, signals, circuits, and control theory (47N70) Numerical solution to inverse problems in abstract spaces (65J22)

Related Items (6)

Unnamed Item ⋮ Algorithms for zeros of two accretive operators for solving convex minimization problems and its application to image restoration problems ⋮ Unnamed Item ⋮ Hybrid viscosity implicit scheme for variational inequalities over the fixed point set of an asymptotically nonexpansive mapping in the intermediate sense in Banach spaces ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Modified Hybrid Steepest Method for the Split Feasibility Problem in Image Recovery of Inverse Problems