The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming

1967/01/01 by L.M. Bregman · 5 citations

paper · doi:10.1016/0041-5553(67)90040-7

crossref issued 1967/01/01 · crossref published 1967/01/01 · crossref published-print 1967/01/01 · crossref created 2005/02/09 · crossref deposited 2019/01/29 · crossref indexed 2026/08/04

Cited by

• Transferable Human Mobility Network Reconstruction with neuroGravity
• The Symmetry Coefficient of Positively Homogeneous Functions
• Strong convergence for countable generalized Bregman nonexpansive-type mappings with equilibrium and variational inequality constraints
• Variable Smoothing for Weakly Convex Problems with Non-Euclidean Directions
• A geometry-based deep equilibrium model for image restoration under multiplicative Gamma noise
• Curvature Residual Geometry in Bregman Regression