Dykstras algorithm with bregman projections: A convergence proof
type: Item
instance of: scholarly article
title: Dykstras algorithm with bregman projections: A convergence proof
zbMATH Open document ID: 0992.90052
DOI: 10.1080/02331930008844513
author: Heinz H. Bauschke
author: A. S. Lewis
published in: Optimization
publication date: 2001-11-27T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 41A29
Mathematics Subject Classification ID: 65J05
zbMATH DE Number: 1586150
zbMATH Keywords: Han's algorithm
zbMATH Keywords: Hildreth's method
zbMATH Keywords: Dykstra's algorithm
zbMATH Keywords: cyclic Bregman projections
zbMATH Keywords: best approximation
zbMATH Keywords: convex feasibility
zbMATH Keywords: Bregman distances
zbMATH Keywords: Legendre functions
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1080/02331930008844513
OpenAlex ID: W2027711030
cites work: Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces
cites work: Dykstra's alternating projection algorithm for two sets
cites work: On Projection Algorithms for Solving Convex Feasibility Problems
cites work: Iterative averaging of entropic projections for solving stochastic convex feasibility problems
cites work: On a proximal point method for convex optimization in banach spaces
cites work: A multiprojection algorithm using Bregman projections in a product space
cites work: An iterative row-action method for interval convex programming
cites work: Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization
cites work: Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
cites work: A relaxed version of Bregman's method for convex programming
cites work: The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
cites work: An Algorithm for Restricted Least Squares Regression
cites work: Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
cites work: Approximate iterations in Bregman-function-based proximal algorithms
cites work: Dykstra's Algorithm for a Constrained Least-squares Matrix Problem
cites work: A cyclic projection algorithm via duality
cites work: An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
cites work: An alternating projections method for certain linear problems in a Hilbert space
cites work: A successive projection method
cites work: On the convergence of Han's method for convex programming with quadratic objective
cites work: Block-iterative surrogate projection methods for convex feasibility problems
cites work: Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
cites work: Proximal Minimization Methods with Generalized Bregman Functions
cites work: Generalized Bregman projections in convex feasibility problems
cites work: Q4235027
cites work: Entropic Proximal Mappings with Applications to Nonlinear Programming
cites work: Dual coordinate ascent methods for non-strictly convex minimization
description: scientific article