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

[1]  William S. Dorn.  A Duality Theorem for Convex Programs , 1960, IBM J. Res. Dev..

[2]  S. Agmon.  The Relaxation Method for Linear Inequalities , 1954, Canadian Journal of Mathematics.

[3]  I. J. Schoenberg,et al.  The Relaxation Method for Linear Inequalities , 1954, Canadian Journal of Mathematics.