New Bregman projection algorithms for solving the split feasibility problem
From MaRDI portal
Publication:6187731
DOI10.23952/jnva.7.2023.6.06OpenAlexW4389705548MaRDI QIDQ6187731
No author found.
Publication date: 15 January 2024
Published in: Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.23952/jnva.7.2023.6.06
Cites Work
- Strong convergence of a relaxed CQ algorithm for the split feasibility problem
- The relaxed inexact projection methods for the split feasibility problem
- Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
- A multiprojection algorithm using Bregman projections in a product space
- The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
- New Bregman projection methods for solving pseudo-monotone variational inequality problem
- Adaptively relaxed algorithms for solving the split feasibility problem with a new step size
- On linear infeasibility arising in intensity-modulated radiation therapy inverse planning
- Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Solving the split feasibility problem without prior knowledge of matrix norms
- 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
- The relaxed CQ algorithm solving the split feasibility problem
- Modified extragradient method with Bregman distance for variational inequalities
- An alternated inertial general splitting method with linearization for the split feasibility problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: New Bregman projection algorithms for solving the split feasibility problem
