|
|
Publications in Math-Net.Ru |
Citations |
|
2013 |
1. |
I. I. Eremin, E. Kh. Gimadi, A. V. Kel'manov, A. V. Pyatkin, M. Yu. Khachai, “$2$-approximate algorithm for finding a clique with minimum weight of vertices and edges”, Trudy Inst. Mat. i Mekh. UrO RAN, 19:2 (2013), 134–143 ; Proc. Steklov Inst. Math. (Suppl.), 284, suppl. 1 (2014), 87–95 |
6
|
|
2012 |
2. |
I. I. Eremin, L. D. Popov, “Interior penalty functions and duality in linear programming”, Trudy Inst. Mat. i Mekh. UrO RAN, 18:3 (2012), 83–89 ; Proc. Steklov Inst. Math. (Suppl.), 283, suppl. 1 (2013), 56–63 |
5
|
|
2010 |
3. |
I. I. Eremin, “Methods for solving systems of linear and convex inequalities based on the Fejér principle”, Trudy Inst. Mat. i Mekh. UrO RAN, 16:3 (2010), 67–77 ; Proc. Steklov Inst. Math. (Suppl.), 272, suppl. 1 (2011), S36–S45 |
1
|
|
2009 |
4. |
I. I. Eremin, L. D. Popov, “Fejér processes in theory and practice: recent results”, Izv. Vyssh. Uchebn. Zaved. Mat., 2009, no. 1, 44–65 ; Russian Math. (Iz. VUZ), 53:1 (2009), 36–55 |
14
|
5. |
I. I. Eremin, “Contraction mapping”, Trudy Inst. Mat. i Mekh. UrO RAN, 15:3 (2009), 106–115 ; Proc. Steklov Inst. Math. (Suppl.), 268, suppl. 1 (2010), S85–S94 |
3
|
|
2008 |
6. |
I. I. Eremin, L. D. Popov, “Closed Fejér cycles for incompatible systems of convex inequalities”, Izv. Vyssh. Uchebn. Zaved. Mat., 2008, no. 1, 11–19 ; Russian Math. (Iz. VUZ), 52:1 (2008), 8–16 |
5
|
7. |
I. I. Eremin, “Author’s results on Mathematical Programming in retrospect”, Trudy Inst. Mat. i Mekh. UrO RAN, 14:2 (2008), 58–66 ; Proc. Steklov Inst. Math. (Suppl.), 263, suppl. 2 (2008), S47–S56 |
3
|
|
2007 |
8. |
I. I. Eremin, A. I. Kibzun, “Current problems in parallelization of the computation algorithms and organization of parallel computations”, Avtomat. i Telemekh., 2007, no. 5, 3 ; Autom. Remote Control, 68:5 (2007), 745 |
|
2006 |
9. |
I. I. Eremin, “Fejér methods for the strong separability of convex polyhedral sets”, Izv. Vyssh. Uchebn. Zaved. Mat., 2006, no. 12, 33–43 ; Russian Math. (Iz. VUZ), 50:12 (2006), 30–40 |
11
|
10. |
I. I. Eremin, “Direct-dual Fejér methods for problems of quadratic programming”, Trudy Inst. Mat. i Mekh. UrO RAN, 12:1 (2006), 86–97 ; Proc. Steklov Inst. Math. (Suppl.), 253, suppl. 1 (2006), S83–S95 |
2
|
|
2004 |
11. |
E. A. Berdnikova, I. I. Eremin, L. D. Popov, “Distributed fejer processes for systems of linear inequalities and problems of linear programming”, Avtomat. i Telemekh., 2004, no. 2, 16–32 ; Autom. Remote Control, 65:2 (2004), 168–183 |
12
|
12. |
I. I. Eremin, “Fejér processes: synthesis and randomization”, Trudy Inst. Mat. i Mekh. UrO RAN, 10:2 (2004), 58–68 ; Proc. Steklov Inst. Math. (Suppl.), 2004no. , suppl. 2, S40–S51 |
2
|
|
2002 |
13. |
I. I. Eremin, S. V. Patsko, “Fejér processes for infinite systems of convex inequalities”, Trudy Inst. Mat. i Mekh. UrO RAN, 8:1 (2002), 45–65 ; Proc. Steklov Inst. Math. (Suppl.), 2002no. , suppl. 1, S32–S51 |
2
|
|
1999 |
14. |
I. I. Eremin, “General theory of stability in linear programming”, Izv. Vyssh. Uchebn. Zaved. Mat., 1999, no. 12, 43–52 ; Russian Math. (Iz. VUZ), 43:12 (1999), 40–48 |
6
|
|
1998 |
15. |
I. I. Eremin, “On quadratic and fully quadratic problems of convex programming”, Izv. Vyssh. Uchebn. Zaved. Mat., 1998, no. 12, 22–28 ; Russian Math. (Iz. VUZ), 42:12 (1998), 20–26 |
8
|
16. |
I. I. Eremin, “Sigma-piecewise functions and problems of disjunctive programming”, Trudy Inst. Mat. i Mekh. UrO RAN, 5 (1998), 357–380 |
2
|
|
1997 |
17. |
I. I. Eremin, “Some questions of piecewise linear programming”, Izv. Vyssh. Uchebn. Zaved. Mat., 1997, no. 12, 49–61 ; Russian Math. (Iz. VUZ), 41:12 (1997), 47–59 |
5
|
|
1996 |
18. |
I. I. Eremin, “On the penalty method in mathematical programming”, Dokl. Akad. Nauk, 346:4 (1996), 459–461 |
4
|
19. |
I. I. Eremin, “Duality for improper problems of Pareto and lexicographic linear optimization”, Trudy Inst. Mat. i Mekh. UrO RAN, 4 (1996), 322–336 |
2
|
|
1995 |
20. |
I. I. Eremin, “A finite iterative method for finding an interior point of an algebraic polyhedron, and estimation of the number of steps”, Izv. Vyssh. Uchebn. Zaved. Mat., 1995, no. 12, 19–25 ; Russian Math. (Iz. VUZ), 39:12 (1995), 16–22 |
1
|
21. |
I. I. Eremin, “The duality for Pareto-successive linear optimization problems”, Trudy Inst. Mat. i Mekh. UrO RAN, 3 (1995), 245–260 |
4
|
|
1994 |
22. |
I. I. Eremin, “A Pareto-sequential problem of linear optimization and duality”, Dokl. Akad. Nauk, 334:2 (1994), 141–143 ; Dokl. Math., 49:1 (1994), 47–51 |
2
|
|
1993 |
23. |
I. I. Eremin, “Duality for Pareto-sequential problems of linear optimization”, Izv. Vyssh. Uchebn. Zaved. Mat., 1993, no. 12, 3–10 ; Russian Math. (Iz. VUZ), 37:12 (1993), 1–9 |
2
|
|
1992 |
24. |
I. I. Eremin, “The lexicographic duality for improper problems in linear and quadratic programming”, Trudy Inst. Mat. i Mekh. UrO RAN, 1 (1992), 178–192 |
2
|
|
1991 |
25. |
I. I. Eremin, “Symmetric duality for problems of sequential linear programming”, Dokl. Akad. Nauk SSSR, 317:5 (1991), 1045–1048 ; Dokl. Math., 43:2 (1991), 581–583 |
2
|
|
1984 |
26. |
I. I. Eremin, “Questions of duality for improper problems of mathematical
programming”, Algebra Logika, 23:6 (1984), 624–636 |
1
|
|
1982 |
27. |
I. I. Eremin, “Duality for nonproper problems in linear programming”, Mat. Zametki, 32:2 (1982), 229–238 ; Math. Notes, 32:2 (1982), 594–599 |
2
|
|
1981 |
28. |
I. I. Eremin, “Duality for improper problems of linear and convex programming”, Dokl. Akad. Nauk SSSR, 256:2 (1981), 272–276 |
16
|
|
1979 |
29. |
I. I. Eremin, “Standard iterative processes of unsmooth optimization for non-stationary problems of convex programming. II”, Zh. Vychisl. Mat. Mat. Fiz., 19:1 (1979), 112–120 ; U.S.S.R. Comput. Math. Math. Phys., 19:1 (1979), 114–124 |
1
|
|
1978 |
30. |
I. I. Eremin, “Standard iteration processes of nonsmooth optimization for nonstationary convex programming problems. I”, Zh. Vychisl. Mat. Mat. Fiz., 18:6 (1978), 1430–1442 ; U.S.S.R. Comput. Math. Math. Phys., 18:6 (1978), 69–82 |
1
|
|
1976 |
31. |
I. I. Eremin, “Discrete processes of Fejér type for nondifferentiable convex
programming problems”, Algebra Logika, 15:6 (1976), 628–641 |
1
|
|
1973 |
32. |
I. I. Eremin, “Problems of successive programming”, Sibirsk. Mat. Zh., 14:1 (1973), 53–63 ; Siberian Math. J., 14:1 (1973), 36–43 |
18
|
|
1969 |
33. |
I. I. Eremin, “Fejér transformations and a problem of convex programming”, Sibirsk. Mat. Zh., 10:5 (1969), 1034–1047 ; Siberian Math. J., 10:5 (1969), 762–772 |
21
|
34. |
I. I. Eremin, “The application of the method of Fejer approximations to the solution of problems of convex programming with non-smooth constraints”, Zh. Vychisl. Mat. Mat. Fiz., 9:5 (1969), 1153–1160 ; U.S.S.R. Comput. Math. Math. Phys., 9:5 (1969), 225–235 |
5
|
|
1968 |
35. |
I. I. Eremin, “On the speed of convergence in the method of Fejer approximations”, Mat. Zametki, 4:1 (1968), 53–61 ; Math. Notes, 4:1 (1968), 522–527 |
4
|
36. |
I. I. Eremin, “Methods of fejer's approximations in convex programming”, Mat. Zametki, 3:2 (1968), 217–234 ; Math. Notes, 3:2 (1968), 139–149 |
18
|
|
1967 |
37. |
I. I. Eremin, “The method of “penalties” in convex programming”, Dokl. Akad. Nauk SSSR, 173:4 (1967), 748–751 |
22
|
38. |
I. I. Eremin, M. A. Kostina, “The penalty method in linear programming and its realization on a computer”, Zh. Vychisl. Mat. Mat. Fiz., 7:6 (1967), 1358–1366 ; U.S.S.R. Comput. Math. Math. Phys., 7:6 (1967), 188–200 |
3
|
|
1966 |
39. |
I. I. Eremin, V. D. Mazurov, “Iteration method for solving problems of convex programming”, Dokl. Akad. Nauk SSSR, 170:1 (1966), 57–60 |
1
|
40. |
I. I. Eremin, “On systems of inequalities with convex functions in the left-hand sides”, Izv. Akad. Nauk SSSR Ser. Mat., 30:2 (1966), 265–278 |
3
|
|
1965 |
41. |
I. I. Eremin, “The relaxation method of solving systems of inequalities with convex functions on the left-hand side”, Dokl. Akad. Nauk SSSR, 160:5 (1965), 994–996 |
3
|
42. |
I. I. Eremin, “Generalization of the relaxation method of Motzkin and Agmon”, Uspekhi Mat. Nauk, 20:2(122) (1965), 183–187 |
10
|
|
1962 |
43. |
I. I. Eremin, “An iterative method for Chebyshev approximations of incompatible systems of linear inequalities”, Dokl. Akad. Nauk SSSR, 143:6 (1962), 1254–1256 |
3
|
|
1961 |
44. |
I. I. Eremin, “Incompatible systems of linear inequalities”, Dokl. Akad. Nauk SSSR, 138:6 (1961), 1280–1283 |
3
|
45. |
I. I. Eremin, “Groups with finite classes of conjugate subgroups with a given property”, Dokl. Akad. Nauk SSSR, 137:4 (1961), 772–773 |
1
|
|
1960 |
46. |
I. I. Eremin, “On central extensions by means of thin layer-finite groups”, Izv. Vyssh. Uchebn. Zaved. Mat., 1960, no. 2, 93–95 |
1
|
|
1959 |
47. |
I. I. Eremin, “Groups with finite classes of conjugate abelian subgroups”, Mat. Sb. (N.S.), 47(89):1 (1959), 45–54 |
2
|
|
1958 |
48. |
I. I. Eremin, “Groups with finite classes of conjugate Abelian subgroups”, Dokl. Akad. Nauk SSSR, 118:2 (1958), 223–224 |
1
|
|
1956 |
49. |
I. I. Eremin, “On some properties of nodes of a system of linear inequalities”, Uspekhi Mat. Nauk, 11:2(68) (1956), 169–172 |
1
|
|
|
|
2012 |
50. |
I. I. Eremin, A. A. Makhnev, “On the 100th birthday of Sergei Nikolaevich Chernikov”, Trudy Inst. Mat. i Mekh. UrO RAN, 18:3 (2012), 5–9 ; Proc. Steklov Inst. Math. (Suppl.), 283, suppl. 1 (2013), 1–5 |
1
|
|
2011 |
51. |
N. N. Krasovskii, I. I. Eremin, A. M. Il'in, A. V. Kryazhimskii, A. B. Kurzhanskii, V. I. Berdyshev, V. V. Vasin, A. A. Makhnev, S. V. Matveev, Yu. N. Subbotin, A. G. Chentsov, V. N. Ushakov, V. V. Kabanov, V. I. Maksimov, “To the 75th anniversary of academician of Russian Academy of Sciences Yu. S. Osipov”, Trudy Inst. Mat. i Mekh. UrO RAN, 17:2 (2011), 5–6 ; Proc. Steklov Inst. Math. (Suppl.), 276, suppl. 1 (2012), S1–S3 |
2
|
|
2004 |
52. |
I. I. Eremin, “XXII All-Russian Conference "Mathematical Programming and Applications"”, Avtomat. i Telemekh., 2004, no. 2, 4–6 ; Autom. Remote Control, 65:2 (2004), 158–159 |
53. |
I. I. Eremin, A. I. Kibzun, “Problems of the modern optimization theory”, Avtomat. i Telemekh., 2004, no. 2, 3 ; Autom. Remote Control, 65:2 (2004), 157 |
|
1973 |
54. |
I. I. Eremin, D. I. Zaitsev, M. I. Kargapolov, V. S. Charin, “Sergei Nikolaevich Chernikov (on his sixtieth birthday)”, Uspekhi Mat. Nauk, 28:1(169) (1973), 259–260 ; Russian Math. Surveys, 28:1 (1973), 175–180 |
2
|
|
1970 |
55. |
I. I. Eremin, “A. Jaeger, Ê. Wenke. Lineare Wirtschaftsalgebra. Stuttgart, Teubner, 1969, X+334S. (Book review)”, Zh. Vychisl. Mat. Mat. Fiz., 10:5 (1970), 1327–1328 ; U.S.S.R. Comput. Math. Math. Phys., 10:5 (1970), 336 |
|
1969 |
56. |
I. I. Eremin, “Lineares optimieren: W. Vogel. Akad. Verlag, Leipzig. 372 S., 1967”, Zh. Vychisl. Mat. Mat. Fiz., 9:6 (1969), 1427 ; U.S.S.R. Comput. Math. Math. Phys., 9:6 (1969), 258–259 |
|
1968 |
57. |
I. I. Eremin, “Numerische methoden der mathematischen optimierung mit ALGOL- und FORTRAN-Programmen: H. P. Kunzi,
H. G. Tzschach and C. A. Zehnder. Teubner, Stuttgart, 1967”, Zh. Vychisl. Mat. Mat. Fiz., 8:6 (1968), 1422 ; U.S.S.R. Comput. Math. Math. Phys., 8:6 (1968), 341 |
58. |
I. I. Eremin, “Programme, spiele, transportnetze: C. Berge, A. Ghouila-Houri. Leipzig. Programmy, igry, transportnye seti Teubner, 1967, 256 pp., K. Berzh, A. Dzhuil'-Khuri”, Zh. Vychisl. Mat. Mat. Fiz., 8:2 (1968), 504 ; U.S.S.R. Comput. Math. Math. Phys., 8:2 (1968), 381–382 |
|
Organisations |
|
|
|
|