Block-Iterative Algorithms with Underrelaxed Bregman Projections

DOI10.1137/S1052623401389439MaRDI QIDQ4785881zbMATH OpenFDO

Authors Gabor T. Herman, Yair Censor

Publication date 5 January 2003

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

zbMATH Keywords

Bregman functionsConvex feasibility problemBlock-iterative projectionsUnderrelaxation

Mathematics Subject Classification ID

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

Recommendations

• Iterative projection onto convex sets using multiple Bregman distances
• On Diagonally Relaxed Orthogonal Projection Methods
• A multiprojection algorithm using Bregman projections in a product space
• On the behavior of a block-iterative projection method for solving convex feasibility problems
• Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback--Leibler distance minimization

Cited in

(19)

• A counterexample to De Pierro's conjecture on the convergence of under-relaxed cyclic projections
• On Diagonally Relaxed Orthogonal Projection Methods
• scientific article; zbMATH DE number 766292 (Why is no real title available?)
• Algorithms for the quasiconvex feasibility problem
• Subgradient algorithms for solving variable inequalities
• Regularizing with Bregman-Moreau envelopes
• A subgradient-like algorithm for solving vector convex inequalities
• Convergence of sequential parafirmly nonexpansive mappings in reflexive Banach spaces
• Block-based refitting in \(\ell_{12}\) sparse regularization
• A relaxed version of Bregman's method for convex programming
• The convergence of the block cyclic projection with an overrelaxation parameter for compressed sensing based tomography
• The Generalized Bregman Distance
• Accelerated under-relaxed parallel projection algorithms for convex set theoretic image recovery problem
• Fast iterative computation of optimal two-block H/sup infinity /-norm
• From convex feasibility to convex constrained optimization using block action projection methods and underrelaxation
• Bregman-Legendre multidistance projection algorithms for convex feasibility and optimization
• Bregman proximal mappings and Bregman-Moreau envelopes under relative prox-regularity
• Interval underrelaxed bregman's method with an application
• Block-iterative surrogate projection methods for convex feasibility problems

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

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