Polyak Roman A

Publications in Math-Net.Ru

1. On finding a fixed point of a class of set-valued mappings
   
   Dokl. Akad. Nauk SSSR, 242:6 (1978),  1252–1255
2. Methods of control sequences in extremal problems in the presence of constraints
   
   Zh. Vychisl. Mat. Mat. Fiz., 18:1 (1978),  17–34
3. On accelerating the convergence of convex programming methods
   
   Dokl. Akad. Nauk SSSR, 212:5 (1973),  1063–1066
4. On the acceleration of convergence of convex programming methods
   
   Dokl. Akad. Nauk SSSR, 209:5 (1973),  1024–1027
5. On a general problem of determining equilibrium
   
   Dokl. Akad. Nauk SSSR, 209:2 (1973),  279–282
6. On best convex Cebysev approximation
   
   Dokl. Akad. Nauk SSSR, 200:3 (1971),  538–540
7. The concave $n$-person game and a certain production model
   
   Dokl. Akad. Nauk SSSR, 191:6 (1970),  1220–1223
8. Two methods of finding equilibrium points of concave $n$-person games
   
   Dokl. Akad. Nauk SSSR, 185:1 (1969),  24–27
9. A problem of nonconvex programming
   
   Dokl. Akad. Nauk SSSR, 179:4 (1968),  786–789
10. A numerical method for solving the problem of convex programming in Hilbert space
    
    Dokl. Akad. Nauk SSSR, 163:2 (1965),  282–284
11. An algorithm for solving the problem of rational Chebyshev approximation
    
    Dokl. Akad. Nauk SSSR, 159:4 (1964),  726–729
12. An algorithm for solving a convex programming problem
    
    Dokl. Akad. Nauk SSSR, 153:5 (1963),  991–994
13. An algorithm for solving the convex Chebyshev approximation problem
    
    Dokl. Akad. Nauk SSSR, 151:1 (1963),  27–30