|
|
|
Publications in Math-Net.Ru |
Citations |
|
2011 |
| 1. |
E. G. Gol'shtein, “Numerical solution of an equilibrium problem of based on the generalized level method”, Zh. Vychisl. Mat. Mat. Fiz., 51:9 (2011), 1588–1593   ; Comput. Math. Math. Phys., 51:9 (2011), 1483–1488   |
|
2009 |
| 2. |
E. G. Gol'shtein, “Monotonicity of the mapping associated with a noncooperative multiperson game”, Zh. Vychisl. Mat. Mat. Fiz., 49:9 (2009), 1554–1564  ; Comput. Math. Math. Phys., 49:9 (2009), 1483–1492 |
1
|
|
2005 |
| 3. |
E. G. Gol'shtein, “Method for minimization of quasiconvex functions based on logarithmic barriers”, Zh. Vychisl. Mat. Mat. Fiz., 45:3 (2005), 429–434 ; Comput. Math. Math. Phys., 45:3 (2005), 412–417 |
|
2004 |
| 4. |
E. G. Gol'shtein, “The use of logarithmic barriers for the solution of variational inequalities”, Zh. Vychisl. Mat. Mat. Fiz., 44:6 (2004), 1023–1029 ; Comput. Math. Math. Phys., 44:6 (2004), 969–975 |
|
2002 |
| 5. |
E. G. Gol'shtein, “A method for solving variational inequalities defined by monotone mappings”, Zh. Vychisl. Mat. Mat. Fiz., 42:7 (2002), 958–968 ; Comput. Math. Math. Phys., 42:7 (2002), 921–930 |
5
|
|
2001 |
| 6. |
E. G. Gol'shtein, “Generalized saddle version of the level method”, Zh. Vychisl. Mat. Mat. Fiz., 41:8 (2001), 1139–1147 ; Comput. Math. Math. Phys., 41:8 (2001), 1083–1091 |
2
|
|
1996 |
| 7. |
E. G. Gol'shtein, “Direct-Dual Block Method of Lnear Programming”, Avtomat. i Telemekh., 1996, no. 11, 3–9 ; Autom. Remote Control, 57:11 (1996), 1531–1536 |
2
|
|
1994 |
| 8. |
E. G. Gol'shteĭn, “On a dual block method of linear programming”, Avtomat. i Telemekh., 1994, no. 12, 36–43 ; Autom. Remote Control, 55:12 (1994), 1733–1739 |
|
1986 |
| 9. |
E. G. Gol'shtein, “Block method of convex programming”, Dokl. Akad. Nauk SSSR, 288:1 (1986), 24–27 |
|
1967 |
| 10. |
E. G. Gol'shtein, “Problems of best approximation by elements of a convex set and some properties of the support functionals”, Dokl. Akad. Nauk SSSR, 173:5 (1967), 995–998 |
2
|
| 11. |
E. G. Gol'shtein, “Dual problems of convex and fractionally-convex programming in function spaces”, Dokl. Akad. Nauk SSSR, 172:5 (1967), 1007–1010 |
1
|
|
1966 |
| 12. |
E. G. Gol'shtein, “A general approach to the linear programming of block structures”, Dokl. Akad. Nauk SSSR, 166:5 (1966), 1062–1065 |
|
1962 |
| 13. |
E. G. Gol'shtein, “A general formulation of the best approximation problem”, Dokl. Akad. Nauk SSSR, 144:1 (1962), 21–22 |
1
|
|
1961 |
| 14. |
E. G. Gol'shtein, “The Chebyshev best approximation problem in the complex domain with supplementary conditions
on the coefficients of the approximating polynomial”, Dokl. Akad. Nauk SSSR, 141:2 (1961), 274–276 |
| 15. |
E. G. Gol'shtein, “An infinite-dimensional analogue of the linear programming problem and its applications to some
problems in the theory of approximation”, Dokl. Akad. Nauk SSSR, 140:1 (1961), 23–26 |
| 16. |
E. G. Gol'shtein, “On a generalization of Chebyshev best approximation problem”, Uspekhi Mat. Nauk, 16:4(100) (1961), 208–210 |
1
|
|
1960 |
| 17. |
E. G. Gol'shtein, “A certain class of non-linear extremum problems”, Dokl. Akad. Nauk SSSR, 133:3 (1960), 507–510 |
|
|
|
1972 |
| 18. |
E. G. Gol'shtein, B. S. Mityagin, “Fifth All-Union Conference on Optimal Planning and National Economy Management”, Uspekhi Mat. Nauk, 27:3(165) (1972), 229–231 |
|
1969 |
| 19. |
E. G. Gol'shtein, “Summer School on Mathematical Programming”, Uspekhi Mat. Nauk, 24:1(145) (1969), 239–241 |
|
| Organisations |
|
| |
|
|
Contact us: