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

Agmon, 1954, The relaxation method for linear inequalities, Can. J. Math., 6, 382, 10.4153/CJM-1954-037-2

Motzkin, 1954, The relaxation method for linear inequalities, Can. J. Math., 6, 393, 10.4153/CJM-1954-038-x

Eremin, 1965, A generalization of the Motzkin — Agmon relaxational method, Usp. mat. Nauk, 20, 183

Bregman, 1965, Finding the common point of convex sets by the method of successive projections, Dokl. Akad. Nauk SSSR, 162, 487

Faddeev, 1963

Karlin, 1964

Dorn, 1960, A duality theorem for convex Programms, IBM J. Res. Dev., 4, 407, 10.1147/rd.44.0407

Bregman, 1967, Proof of the convergence of Sheliekhovskii's method for problems with transport restrictions, Zh. vȳchisl. Mat. mat. Fiz., 7, 147