Iterative projection onto convex sets using multiple Bregman distances

DOI10.1088/0266-5611/15/5/313MaRDI QIDQ4719155zbMATH OpenOpenAlexFDO

Authors Charles Byrne

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

zbMATH Keywords

algorithmsblock-iterative algorithmsconvex feasibility problemconvex setsimage reconstructioninverse problemsiterative projection onto convex set methodmultidistance successive generalized projection method

Mathematics Subject Classification ID

General theory of numerical analysis in abstract spaces (65J05) Numerical solution to inverse problems in abstract spaces (65J22) Numerical mathematical programming methods (65K05) Programming in abstract spaces (90C48)

Recommendations

• A multiprojection algorithm using Bregman projections in a product space
• Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback--Leibler distance minimization
• Block-Iterative Algorithms with Underrelaxed Bregman Projections
• Bregman-Legendre multidistance projection algorithms for convex feasibility and optimization

Cited in

(25)

• A multiprojection algorithm using Bregman projections in a product space
• An MM Algorithm for Split Feasibility Problems
• Summed squared distance error reduction by simultaneous multiprojections and applications
• Duality for Bregman projections onto translated cones and affine subspaces.
• New inertial algorithm for solving split common null point problem in Banach spaces
• On Bregman-type distances and their associated projection mappings
• 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
• Bregman-Legendre multidistance projection algorithms for convex feasibility and optimization
• Perturbation-resilient block-iterative projection methods with application to image reconstruction from projections
• scientific article; zbMATH DE number 11803 (Why is no real title available?)
• Generalized projections onto convex sets
• A von Neumann alternating method for finding common solutions to variational inequalities
• Iterating Bregman Retractions
• Block-Iterative Algorithms with Underrelaxed Bregman Projections
• scientific article; zbMATH DE number 1894739 (Why is no real title available?)
• A relaxed projection method for split variational inequalities
• Approximation of solutions of split inverse problem for multi-valued demi-contractive mappings in Hilbert spaces
• The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators
• Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback--Leibler distance minimization
• Incorporating multiple a priori information for inverse problem by inexact scaled gradient projection
• The relaxed inexact projection methods for the split feasibility problem
• Algorithms for the split variational inequality problem
• Pre-conditioning CQ algorithm for solving the split feasibility problem and its application to image restoration problem
• A generalized projection-based scheme for solving convex constrained optimization problems

This page was built for publication: Iterative projection onto convex sets using multiple Bregman distances

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