Content deleted Content added
(7 intermediate revisions by 5 users not shown) | |||
Line 3: | birth_date = January 31, 1941 | birth_place = [[Leningrad]] | | | | occupation = [[Mathematician]] | known_for = [[Bregman divergence]], [[Bregman's Theorem]] }} '''Lev M. Bregman''' ( Bregman received his M. Sc. in mathematics in 1963 at [[Leningrad University]] and his Ph.D. in mathematics in 1966 at the same institution, under the direction of his advisor Prof. [[J. V. Romanovsky]], for his thesis about relaxation methods for finding a common point of convex sets, which led to one of his most well-known publications.<ref>Brègman, L. M. A relaxation method of finding a common point of convex sets and its application to the solution of problems in convex programming. (Russian) Ž. Vyčisl. Mat. i Mat. Fiz. 7 1967 620–631. MR215617 (35 #6457) 90.60 (65.00)</ref> [[Bregman's Theorem]], proving a 1963 conjecture of [[Henryk Minc]], gives an upper bound on the permanent of a 0-1 matrix. Bregman Bregman is author of several text books and dozens of publications in international journals. Line 32 ⟶ 34: {{DEFAULTSORT:Bregman, Lev M.}} [[Category:1941 births]] [[Category: [[Category:Israeli mathematicians]] [[Category:Living people]]
[[Category:Saint Petersburg State University alumni]] |