List of selected publications

 

1. Bregman L. "The method of Successive Projection for Finding a Common Point of Convex Sets". Dokl. Akad. Nauk SSSR, v. 162, No. 3, 1965, p.p. 487-490. (English translation: Soviet Math. Dokl., 1965, p.p. 688-692).

 

2. Bregman L. "A Relaxation Method of Finding a Common Point of Convex Sets and its Application to Problems of Optimization". Dokl. Akad. Nauk SSSR, v. 171, No. 5, 1966, p.p. 1019-1022. (English translation: Soviet Math. Dokl., v. 7, 1966, p.p. 1578-1581).

 

3. Bregman L. "The Proof of the Sheleikhovsky's Method Convergence for the Problems with Transportation Restrictions". J. Wych. Math. and Math. Phys., v. 7, No. 1, 1967, p.p. 147-156.

 

4. Bregman L. "A Relaxation Method of Finding a Common Point of Convex Sets and its Application to the Solution of Convex Programming Problems". J. Wych. Math. and Math.Phys., v. 7, No. 3, 1967, p.p. 620-631.    

 

5. Bregman L. "An Algorithm of Solution of Convex Programming  Problems with the Relaxation Method". In "Optimal Planning", 12. Novosibirsk, 1969, p.p. 91-94. 

 

6. Bregman L., Fokin I. "On the Structure of Optimal Strategies in some Matrix Games". Dokl. Akad. Nauk SSSR, v. 188, No. 5, 1969, p.p. 1019-1022. (English translation:  Soviet Math. Dokl., v. 10, 1969, p.p. 1208-1211). 

 

7. Bregman L. "On an Approach to the Integer Programming Problems". In "Operations Research and Simulation", 1, Leningrad, LGU, 1972. p.p. 42-47. 

 

8. Bregman L., Dvorkin S., Melekh E. "The Optimal Planning of the Wire Factory". In "Operations Research and Simulation", 1, Leningrad, LGU, 1972. p.p. 47-53.  

 

 

9. Bregman L., Fokin I. "On the Sums of Matrix Games". Economika i Math. Metody, v 9, No. 1, 1973, p.p. 148-154.      

 

10. Bregman L. "Some Properties of Nonnegative Matrices and  their Permanents". Dokl. Akad. Nauk SSSR, v. 211, No. 1, 1973, p.p. 27-30. (English translation: Soviet Math. Dokl., v. 14, 1973, p.p. 945-949). 

 

11. Bregman L., Fokin I. "The Method of Solution for Sums of  Matrix Games". In "Operations Research and Simulation", 2, Leningrad, LGU, 1974. p.p. 37-55.

 

12. Bregman L., Fokin I. "On the Equivalent Strategies in the Sums of Matrix Games". "Operations Research and  Simulation",2, Leningrad, LGU, 1974. p.p. 55-63. 

 

 

13. Bregman L., Gribov A., Prygichev A., Sorokina M., Surin S., Shindjakov A. "The System LP-LGU for Linear Programming". In "Operations Research and Simulation", 3, Leningrad, LGU, 1975. p.p. 3-64. 

 

 

14. Bregman L., Romanovsky J. "An Apportionment and Optimization in Allocation Problems". In "Operations  Research and Simulation", 3, Leningrad, LGU, 1975. p.p. 137-163. 

 

15. Bregman L. "The Equivalent Strategies in the Sums of Games". Vestnik LGU, Ser. Mathem., Mech., Astron., 13, 1974, p.p. 13-17.

 

 

16. Bregman L., Prygichev A., Surin S. "The Improving of the Multiplicative Algorithm of the Simplex Method". "Operations Research and Simulation", 4, Leningrad, LGU, 1977. p.p. 3-50. 

 

17. Bregman L., Surin S. "The Control in Linear Programming System for ODRA-1204" "Operations Research and Simulation", 5, Leningrad, LGU, 1979. p.p. 71-94. 

 

18. Bregman L., Naumova N. "Arbitration Solutions with Ideal Point Generated by Systems of Functions". Dokl. Akad. Nauk SSSR, v. 279, No. 1, 1984, p.p. 16-20. (English translation: Soviet Math. Dokl., v. 30, 1984, p.p. 583-587)  

 

19. Bregman L., Fokin I. "Methods of Finding Equilibrium Points in Zero-Sum Polymatrix Games". Optimizatsija, 40(57), Novosibirsk, 1987, p.p. 70-82. 

 

20. Bregman L. "The Projection Method for Inequalities Systems". Sibirskij Math. J. v. 29, No. 4, 1988, p.p. 23-30. (English translation Sib. Math. J. 29, No. 4, p.p. 531-537).

 

21. Bregman L. "The Polynomial Algorithm of the Simplex Type for Linear Inequalities Systems". Cybernetika, No. 1, 1990, p.p. 84-87. (English translation Cybernetics, 26, no. 1,1990,, p.p. 106-110).

 

 

22. Bregman L., Vershik A., Gribov A., Romanovsky J. "50 years of Linear Programming". Economika i Math. Methody, v. 26, iss. 2, 1990, p.p. 376-378.

 

 

23. Baranov S., Bregman L. "Automata decomposition and synthesis with PLAM". Microprocessing and Microprogramming, v. 38, 1993, p.p. 759-766.

 

24. Baranov S., Bregman L. "Synthesis of automata from elements with given constraints on their complexity". Journal of  Microcomputer Application, v. 17, 1994, p.p. 227-237.

 

25. Bregman L., Fokin I." On separable non-cooperative zero-sum games".  Optimization, v. 44, 1998, pp. 69-84. ( Postscript )

 

26. Berger A., Bregman L., Kogan Y. "Bottleneck analysis in multiclass closed queueing networks and its applications". Queueing Systems, v. 31, 1999, pp. 217-237. ( Postscript )

 

 

27. Bregman L. Censor Y., Reich S.  "Dykstra's Algorithm as the Nonlinear Extension of Bregman's Optimization Method". Journal of Convex Analysis, v. 6, 1999, pp. 319--334  ( Postscript )

 

 

28. Bregman L., Fokin I. "A  Parallel Algorithm for Non-cooperative Resource Allocation Games". In: Studies in Computational Mathematics, 8, Inherently Parallel Algorithms in Feasibility and Optimization and their Applications, D. Butnariu, Y. Censor, S. Reich eds, ELSEVIER, 2001, p. 37-48. ( Postscript )

 

 

29. Bregman L.,  Naumova N. "Goal Programming Solutions Generated by Utility Functions", in: Lecture Notes in Economic and Mathematical Systems, 510, Constructing and Applying Objective Functions, A.Tangian and J.Gruber eds., Springer, 2002, p.495 - 514. ( Postscript )