scientific article; zbMATH DE number 1393068

MaRDI QIDQ4936263zbMATH OpenFDO

Authors Yair Censor, Simeon Reich, L. M. Bregman

Publication date 27 January 2000

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

zbMATH Keywords

Bregman projectionconvex programmingDykstra's algorithm

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1174325
• On Dykstra's algorithm: finite convergence, stalling, and the method of alternating projections
• Dykstras algorithm with bregman projections: A convergence proof
• An acceleration scheme for Dykstra's algorithm
• scientific article; zbMATH DE number 5564093

Cited in

(13)

• Entropic approximation of Wasserstein gradient flows
• Construction of best Bregman approximations in reflexive Banach spaces
• Computational acceleration of projection algorithms for the linear best approximation problem
• Monotonically convergent algorithms for symmetric tensor approximation
• An acceleration scheme for Dykstra's algorithm
• One-step Bregman projection methods for solving variational inequalities in reflexive Banach spaces
• Convergence of two simple methods for solving monotone inclusion problems in reflexive Banach spaces
• Convergence of entropic schemes for optimal transport and gradient flows
• The Legendre transformation in modern optimization
• Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces.
• Dykstras algorithm with bregman projections: A convergence proof
• Re-examination of Bregman functions and new properties of their divergences
• A Mann type hybrid generalized \(f\)-projection iterative method for a class of nonlinear mappings

This page was built for publication:

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