Solving a split feasibility problem by the strong convergence of two projection algorithms in Hilbert spaces

DOI10.1155/2021/5562694zbMath1481.47090OpenAlexW3139210226MaRDI QIDQ830127

N. E. Zubov

Publication date: 7 May 2021

Published in: Journal of Function Spaces (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2021/5562694

zbMATH Keywords

strong convergenceHilbert spaceshybrid projection methodsinertial shrinking projection algorithmssplit convex feasibility problem

Mathematics Subject Classification ID

Variational and other types of inequalities involving nonlinear operators (general) (47J20) Iterative procedures involving nonlinear operators (47J25) Numerical methods for variational inequalities and related problems (65K15)

Related Items (1)

Accelerated modified inertial Mann and viscosity algorithms to find a fixed point of \(\alpha\)-inverse strongly monotone operators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A regularized gradient projection method for the minimization problem
• Forward-backward splitting methods for accretive operators in Banach spaces
• Averaged mappings and the gradient-projection algorithm
• Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
• Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
• A multiprojection algorithm using Bregman projections in a product space
• Tseng type methods for solving inclusion problems and its applications
• A strong convergence result involving an inertial forward-backward algorithm for monotone inclusions
• General inertial Mann algorithms and their convergence analysis for nonexpansive mappings
• Convergence of a splitting inertial proximal method for monotone operators
• Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups.
• On the contraction-proximal point algorithms with multi-parameters
• A new hybrid algorithm for a nonexpansive mapping
• Shrinking projection methods for accelerating relaxed inertial Tseng-type algorithm with applications
• Convergence of splitting algorithms for the sum of two accretive operators with applications
• Inertial accelerated algorithms for solving a split feasibility problem
• Strong convergence of the CQ method for fixed point iteration processes
• The Numerical Solution of Parabolic and Elliptic Differential Equations
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• The multiple-sets split feasibility problem and its applications for inverse problems
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• 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
• A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
• A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
• Signal Recovery by Proximal Forward-Backward Splitting
• Fixed Point Theory for Lipschitzian-type Mappings with Applications
• Some methods of speeding up the convergence of iteration methods
• A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
• Convex analysis and monotone operator theory in Hilbert spaces
• An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
• Iterative approximations for zeros of sum of accretive operators in Banach spaces

This page was built for publication: Solving a split feasibility problem by the strong convergence of two projection algorithms in Hilbert spaces