Dykstras algorithm with bregman projections: A convergence proof
From MaRDI portal
Publication:2709445
DOI10.1080/02331930008844513zbMath0992.90052OpenAlexW2027711030MaRDI QIDQ2709445
Heinz H. Bauschke, Adrian S. Lewis
Publication date: 27 November 2001
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930008844513
Legendre functionsbest approximationBregman distancesDykstra's algorithmconvex feasibilitycyclic Bregman projectionsHildreth's methodHan's algorithm
Convex programming (90C25) General theory of numerical analysis in abstract spaces (65J05) Numerical optimization and variational techniques (65K10) Approximation with constraints (41A29)
Related Items
Entropic Approximation of Wasserstein Gradient Flows, Scaling algorithms for unbalanced optimal transport problems, Regularizing with Bregman--Moreau Envelopes, The extension of the linear inequality method for generalized rational Chebyshev approximation to approximation by general quasilinear functions, Multivariate approximation by polynomial and generalized rational functions, Prediction in Riemannian metrics derived from divergence functions, Monotonically convergent algorithms for symmetric tensor approximation, Bregman-Golden ratio algorithms for variational inequalities, Provable Phase Retrieval with Mirror Descent, Convergence Rate Analysis of a Dykstra-Type Projection Algorithm, Approximation of fixed points of weak Bregman relatively nonexpansive mappings in Banach spaces, A multi-objective interpretation of optimal transport, An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems, Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces., Bivariate rational approximations of the general temperature integral, Minimization of Tikhonov functionals in Banach spaces, Generalized incompressible flows, multi-marginal transport and Sinkhorn algorithm, An iterated projection approach to variational problems under generalized convexity constraints, Computation of Cournot-Nash equilibria by entropic regularization, Convergence of Entropic Schemes for Optimal Transport and Gradient Flows, Unnamed Item, Convergence of sequential parafirmly nonexpansive mappings in reflexive Banach spaces, Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces, Klee sets and Chebyshev centers for the right Bregman distance, Computational acceleration of projection algorithms for the linear best approximation problem, Unnamed Item, Construction of best Bregman approximations in reflexive Banach spaces, Generalized Sinkhorn Iterations for Regularizing Inverse Problems Using Optimal Mass Transport, Low Complexity Regularization of Linear Inverse Problems, Bregman proximal mappings and Bregman-Moreau envelopes under relative prox-regularity, Quantum entropic regularization of matrix-valued optimal transport, Multimarginal Optimal Transport with a Tree-Structured Cost and the Schrödinger Bridge Problem, Iterative Bregman Projections for Regularized Transportation Problems
Cites Work
- Unnamed Item
- A relaxed version of Bregman's method for convex programming
- A cyclic projection algorithm via duality
- An iterative row-action method for interval convex programming
- On the convergence of Han's method for convex programming with quadratic objective
- A successive projection method
- Approximate iterations in Bregman-function-based proximal algorithms
- Dykstra's alternating projection algorithm for two sets
- A multiprojection algorithm using Bregman projections in a product space
- Block-iterative surrogate projection methods for convex feasibility problems
- Iterative averaging of entropic projections for solving stochastic convex feasibility problems
- Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces
- Generalized Bregman projections in convex feasibility problems
- Dual coordinate ascent methods for non-strictly convex minimization
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- An Algorithm for Restricted Least Squares Regression
- An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- Dykstra's Algorithm for a Constrained Least-squares Matrix Problem
- The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
- Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
- Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization
- Proximal Minimization Methods with Generalized Bregman Functions
- On a proximal point method for convex optimization in banach spaces
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- On Projection Algorithms for Solving Convex Feasibility Problems
- An alternating projections method for certain linear problems in a Hilbert space
