Solving a split feasibility problem by the strong convergence of two projection algorithms in Hilbert spaces
From MaRDI portal
Publication:830127
DOI10.1155/2021/5562694zbMATH Open1481.47090OpenAlexW3139210226MaRDI QIDQ830127FDOQ830127
Authors: 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
Recommendations
- Strong convergence result for proximal split feasibility problem in Hilbert spaces
- Strong convergence of two algorithms for the split feasibility problem in Banach spaces
- Splitting methods for a convex feasibility problem in Hilbert spaces
- A strongly convergent method for the split feasibility problem
- Strong convergence theorems by shrinking projection methods for generalized split feasibility problems in Hilbert spaces
- A gradient projection method for solving split equality and split feasibility problems in Hilbert spaces
- Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces
- An optimization approach to solving the split feasibility problem in Hilbert spaces
- Iterative algorithms for solving the split feasibility problem in Hilbert spaces
- Strong convergence of the modified projection and contraction methods for split feasibility problem
strong convergenceHilbert spaceshybrid projection methodsinertial shrinking projection algorithmssplit convex feasibility problem
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- A multiprojection algorithm using Bregman projections in a product space
- A new hybrid algorithm for a nonexpansive mapping
- A note on the gradient projection method with exact stepsize rule
- A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
- A regularized gradient projection method for the minimization problem
- A strong convergence result involving an inertial forward-backward algorithm for monotone inclusions
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
- Averaged mappings and the gradient-projection algorithm
- Convergence of a splitting inertial proximal method for monotone operators
- Convergence of splitting algorithms for the sum of two accretive operators with applications
- Convex analysis and monotone operator theory in Hilbert spaces
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- Fixed Point Theory for Lipschitzian-type Mappings with Applications
- Forward-backward splitting methods for accretive operators in Banach spaces
- General inertial Mann algorithms and their convergence analysis for nonexpansive mappings
- Inertial accelerated algorithms for solving a split feasibility problem
- Iterative approximations for zeros of sum of accretive operators in Banach spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
- Nonlinear functional analysis. Fixed point theory and its applications
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- On the contraction-proximal point algorithms with multi-parameters
- Shrinking projection methods for accelerating relaxed inertial Tseng-type algorithm with applications
- Signal Recovery by Proximal Forward-Backward Splitting
- Some methods of speeding up the convergence of iteration methods
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Strong convergence of the CQ method for fixed point iteration processes
- Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups.
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- The multiple-sets split feasibility problem and its applications for inverse problems
- Tseng type methods for solving inclusion problems and its applications
Cited In (11)
- Convergence analysis for solving equilibrium problems and split feasibility problems in Hilbert spaces
- Two proximal splitting methods in Hadamard spaces
- Accelerated modified inertial Mann and viscosity algorithms to find a fixed point of \(\alpha\)-inverse strongly monotone operators
- Strong convergence of the modified projection and contraction methods for split feasibility problem
- Shrinking projection methods for accelerating relaxed inertial Tseng-type algorithm with applications
- Splitting methods for a convex feasibility problem in Hilbert spaces
- An algorithm to solve the variational inequality problem based on the common solutions of two classes of problems
- A new halfspace-relaxation projection method for the split feasibility problem
- Linear convergence of the relaxed gradient projection algorithm for solving the split equality problems in Hilbert spaces
- Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces
- On solving proximal split feasibility problems and applications
This page was built for publication: Solving a split feasibility problem by the strong convergence of two projection algorithms in Hilbert spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q830127)
