Iterative projection onto convex sets using multiple Bregman distances
From MaRDI portal
Publication:4719155
DOI10.1088/0266-5611/15/5/313zbMath0940.65072OpenAlexW2056218782MaRDI QIDQ4719155
Publication date: 19 July 2000
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1088/0266-5611/15/5/313
algorithmsinverse problemsconvex setsimage reconstructionconvex feasibility problemblock-iterative algorithmsiterative projection onto convex set methodmultidistance successive generalized projection method
Numerical mathematical programming methods (65K05) General theory of numerical analysis in abstract spaces (65J05) Programming in abstract spaces (90C48) Numerical solution to inverse problems in abstract spaces (65J22)
Related Items
A real-time iterative projection scheme for solving the common fixed point problem and its applications ⋮ A preconditioning method of the CQ algorithm for solving an extended split feasibility problem ⋮ The relaxed inexact projection methods for the split feasibility problem ⋮ A von Neumann alternating method for finding common solutions to variational inequalities ⋮ The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators ⋮ Algorithms for the split variational inequality problem ⋮ A relaxed projection method for split variational inequalities ⋮ A generalized projection-based scheme for solving convex constrained optimization problems ⋮ An MM Algorithm for Split Feasibility Problems ⋮ Unnamed Item ⋮ New inertial algorithm for solving split common null point problem in Banach spaces
