scientific article; zbMATH DE number 1393068

zbMath0960.90067MaRDI QIDQ4936263

Yair Censor, Simeon Reich

Publication date: 27 January 2000

Full work available at URL: https://eudml.org/doc/120935

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

convex programmingBregman projectionDykstra's algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)

Related Items (12)

Entropic Approximation of Wasserstein Gradient Flows ⋮ Convergence of two simple methods for solving monotone inclusion problems in reflexive Banach spaces ⋮ A Mann type hybrid generalized \(f\)-projection iterative method for a class of nonlinear mappings ⋮ Monotonically convergent algorithms for symmetric tensor approximation ⋮ The Legendre Transformation in Modern Optimization ⋮ Re-examination of Bregman functions and new properties of their divergences ⋮ Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. ⋮ Convergence of Entropic Schemes for Optimal Transport and Gradient Flows ⋮ Computational acceleration of projection algorithms for the linear best approximation problem ⋮ One-step Bregman projection methods for solving variational inequalities in reflexive Banach spaces ⋮ Construction of best Bregman approximations in reflexive Banach spaces ⋮ An acceleration scheme for Dykstra's algorithm

This page was built for publication: