The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming
- 1 January 1967
- journal article
- Published by Elsevier in USSR Computational Mathematics and Mathematical Physics
- Vol. 7 (3) , 200-217
- https://doi.org/10.1016/0041-5553(67)90040-7
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- A Duality Theorem for Convex ProgramsIBM Journal of Research and Development, 1960
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954