|
|
|
Publications in Math-Net.Ru |
Citations |
|
1988 |
| 1. |
L. M. Brègman, “The projection method for solving systems of linear inequalities”, Sibirsk. Mat. Zh., 29:4 (1988), 23–30    ; Siberian Math. J., 29:4 (1988), 531–537  |
1
|
|
1984 |
| 2. |
L. M. Brègman, N. I. Naumova, “Arbitration solutions with an ideal point, generated by systems of
functions”, Dokl. Akad. Nauk SSSR, 279:1 (1984), 16–20 |
5
|
|
1973 |
| 3. |
L. M. Brègman, “Some properties of nonnegative matrices and their permanents”, Dokl. Akad. Nauk SSSR, 211:1 (1973), 27–30 |
5
|
|
1969 |
| 4. |
L. M. Brègman, I. N. Fokin, “The structure of the optimal strategies in certain matrix games”, Dokl. Akad. Nauk SSSR, 188:5 (1969), 974–977 |
|
1967 |
| 5. |
L. M. Brègman, “A relaxation method of finding a common point of convex sets and its application to the solution of problems in convex programming”, Zh. Vychisl. Mat. Mat. Fiz., 7:3 (1967), 620–631 ; U.S.S.R. Comput. Math. Math. Phys., 7:3 (1967), 200–217 |
1645
|
| 6. |
L. M. Brègman, “Proof of the convergence of Sheleikhovskii's method for a problem with transportation constraints”, Zh. Vychisl. Mat. Mat. Fiz., 7:1 (1967), 147–156 ; U.S.S.R. Comput. Math. Math. Phys., 7:1 (1967), 191–204 |
68
|
|
1966 |
| 7. |
L. M. Brègman, “Relaxation method for finding a common point of convex sets and its application to optimization problems”, Dokl. Akad. Nauk SSSR, 171:5 (1966), 1019–1022 |
|
1965 |
| 8. |
L. M. Brègman, “Finding the common point of convex sets by the method of successive projection”, Dokl. Akad. Nauk SSSR, 162:3 (1965), 487–490 |
6
|
|
| Organisations |
|
| |
|
|
Contact us: