 | Michiel Hazewinkel - 1997 - 638 sivua
...methods in mathematical programming). References [1] BREGMAN, LM: 'The relaxation method of finding the common points of convex sets and its application to the solution of problems in convex programming', USSR Comput. Math. Math. Phys. 7, no. 3 (1967), 200-217. (Translated... | |
 | Regina S. Burachik, Alfredo N. Iusem - 2007 - 294 sivua
...connexes. Enseignement Mathematique 31 (1932) 14-22. [36] Bregman, LM The relaxation method of finding the common points of convex sets and its application to the solution of problems in convex programming. USSR Computational Mathematics and Mathematical Physics 7 (1967) 200217.... | |
 | Aikakauslehti - Nide 23,Nro 1 - 112 sivua
...Numerical Methods. Prentice Hall, New Jersey (1989). [2] LM Bregman, The relaxation method of finding the common points of convex sets and its application to the solution of problems in convex programming. USSR Computational Mathematics and Mathematical Physics, 7 (3) ( 1967),... | |
| |
Bregman, LM The relaxation method of finding the common points of convex sets and its application to the solution of problems in convex programming. USSR Computational Mathematics and Mathematical Physics 7 (1967) 200217. 