Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback--Leibler distance minimization
From MaRDI portal
Publication:5959328
DOI10.1023/A:1013349430987zbMath1012.90035OpenAlexW292990780MaRDI QIDQ5959328
Publication date: 26 March 2002
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1013349430987
convex feasibility problemBregman projectionKullback-Leibler distanceproduct spaceproximity function
Related Items (25)
Steered sequential projections for the inconsistent convex feasibility problem ⋮ The Generalized Forward-Backward Splitting Method for the Minimization of the Sum of Two Functions in Banach Spaces ⋮ Stochastic block projection algorithms with extrapolation for convex feasibility problems ⋮ Perturbed projections and subgradient projections for the multiple-sets split feasibility problem ⋮ Regularizing with Bregman--Moreau Envelopes ⋮ Distance majorization and its applications ⋮ Convergence of the exponentiated gradient method with Armijo line search ⋮ The Legendre Transformation in Modern Optimization ⋮ Alternating minimization as sequential unconstrained minimization: a survey ⋮ Applications of fixed-point and optimization methods to the multiple-set split feasibility problem ⋮ Linear convergence of the randomized sparse Kaczmarz method ⋮ On the incomplete oblique projections method for solving box constrained least squares problems ⋮ Generalized Bregman envelopes and proximity operators ⋮ Minimization of Tikhonov functionals in Banach spaces ⋮ The Generalized Bregman Distance ⋮ On the existence of minimizers of proximity functions for split feasibility problems ⋮ Incomplete oblique projections for solving large inconsistent linear systems ⋮ Block‐iterative algorithms ⋮ Implicit regularization of the incomplete oblique projections method ⋮ On linear infeasibility arising in intensity-modulated radiation therapy inverse planning ⋮ An efficient simultaneous method for the constrained multiple-sets split feasibility problem ⋮ Bounded perturbation resilience of projected scaled gradient methods ⋮ Bregman proximal mappings and Bregman-Moreau envelopes under relative prox-regularity ⋮ A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant ⋮ Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates
This page was built for publication: Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback--Leibler distance minimization
