New Bregman projection algorithms for solving the split feasibility problem

DOI10.23952/JNVA.7.2023.6.06MaRDI QIDQ6187731zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

Bregman projectionself-adaptive stepsizesplit feasibility problemweak convergence

Mathematics Subject Classification ID

Functional analysis (46-XX) Operator theory (47-XX)

Cites work

• A multiprojection algorithm using Bregman projections in a product space
• A new Bregman projection method for solving variational inequalities in Hilbert spaces
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Adaptively relaxed algorithms for solving the split feasibility problem with a new step size
• An alternated inertial general splitting method with linearization for the split feasibility problem
• Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces
• scientific article; zbMATH DE number 4124452 (Why is no real title available?)
• scientific article; zbMATH DE number 6876349 (Why is no real title available?)
• scientific article; zbMATH DE number 7416598 (Why is no real title available?)
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• Iterative oblique projection onto convex sets and the split feasibility problem
• Modified extragradient method with Bregman distance for variational inequalities
• Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
• New Bregman projection methods for solving pseudo-monotone variational inequality problem
• On linear infeasibility arising in intensity-modulated radiation therapy inverse planning
• On Projection Algorithms for Solving Convex Feasibility Problems
• Solving the split feasibility problem without prior knowledge of matrix norms
• Strong convergence of a relaxed CQ algorithm for the split feasibility problem
• The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
• The relaxed CQ algorithm solving the split feasibility problem
• The relaxed inexact projection methods for the split feasibility problem

Cited in

(2)

• A Bregman projection algorithm with self adaptive step sizes for split variational inequality problems involving non-Lipschitz operators
• Inertial Bregman proximal alternating linearized minimization method with line search for non-convex split feasibility problem

This page was built for publication: New Bregman projection algorithms for solving the split feasibility problem

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