Block-Iterative Algorithms with Underrelaxed Bregman Projections

From MaRDI portal

Publication:4785881

Jump to:navigation, search

DOI10.1137/S1052623401389439zbMath1055.90059MaRDI QIDQ4785881

Gabor T. Herman, Yair Censor

Publication date: 5 January 2003

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

zbMATH Keywords

Bregman functions Convex feasibility problem Block-iterative projections Underrelaxation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items (7)

Subgradient algorithms for solving variable inequalities ⋮ Regularizing with Bregman--Moreau Envelopes ⋮ A subgradient-like algorithm for solving vector convex inequalities ⋮ The Generalized Bregman Distance ⋮ Convergence of sequential parafirmly nonexpansive mappings in reflexive Banach spaces ⋮ Bregman proximal mappings and Bregman-Moreau envelopes under relative prox-regularity ⋮ Algorithms for the quasiconvex feasibility problem

This page was built for publication: Block-Iterative Algorithms with Underrelaxed Bregman Projections

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4785881&oldid=19083806"