RUS  ENG
Full version
PEOPLE

Eremin Ivan Ivanovich

Publications in Math-Net.Ru

  1. $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
  2. Interior penalty functions and duality in linear programming

    Trudy Inst. Mat. i Mekh. UrO RAN, 18:3 (2012),  83–89
  3. 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
  4. Fejér processes in theory and practice: recent results

    Izv. Vyssh. Uchebn. Zaved. Mat., 2009, no. 1,  44–65
  5. Contraction mapping

    Trudy Inst. Mat. i Mekh. UrO RAN, 15:3 (2009),  106–115
  6. Closed Fejér cycles for incompatible systems of convex inequalities

    Izv. Vyssh. Uchebn. Zaved. Mat., 2008, no. 1,  11–19
  7. Author’s results on Mathematical Programming in retrospect

    Trudy Inst. Mat. i Mekh. UrO RAN, 14:2 (2008),  58–66
  8. Current problems in parallelization of the computation algorithms and organization of parallel computations

    Avtomat. i Telemekh., 2007, no. 5,  3
  9. Fejér methods for the strong separability of convex polyhedral sets

    Izv. Vyssh. Uchebn. Zaved. Mat., 2006, no. 12,  33–43
  10. Direct-dual Fejér methods for problems of quadratic programming

    Trudy Inst. Mat. i Mekh. UrO RAN, 12:1 (2006),  86–97
  11. Distributed fejer processes for systems of linear inequalities and problems of linear programming

    Avtomat. i Telemekh., 2004, no. 2,  16–32
  12. Fejér processes: synthesis and randomization

    Trudy Inst. Mat. i Mekh. UrO RAN, 10:2 (2004),  58–68
  13. Fejér processes for infinite systems of convex inequalities

    Trudy Inst. Mat. i Mekh. UrO RAN, 8:1 (2002),  45–65
  14. General theory of stability in linear programming

    Izv. Vyssh. Uchebn. Zaved. Mat., 1999, no. 12,  43–52
  15. On quadratic and fully quadratic problems of convex programming

    Izv. Vyssh. Uchebn. Zaved. Mat., 1998, no. 12,  22–28
  16. Sigma-piecewise functions and problems of disjunctive programming

    Trudy Inst. Mat. i Mekh. UrO RAN, 5 (1998),  357–380
  17. Some questions of piecewise linear programming

    Izv. Vyssh. Uchebn. Zaved. Mat., 1997, no. 12,  49–61
  18. On the penalty method in mathematical programming

    Dokl. Akad. Nauk, 346:4 (1996),  459–461
  19. Duality for improper problems of Pareto and lexicographic linear optimization

    Trudy Inst. Mat. i Mekh. UrO RAN, 4 (1996),  322–336
  20. 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
  21. The duality for Pareto-successive linear optimization problems

    Trudy Inst. Mat. i Mekh. UrO RAN, 3 (1995),  245–260
  22. A Pareto-sequential problem of linear optimization and duality

    Dokl. Akad. Nauk, 334:2 (1994),  141–143
  23. Duality for Pareto-sequential problems of linear optimization

    Izv. Vyssh. Uchebn. Zaved. Mat., 1993, no. 12,  3–10
  24. The lexicographic duality for improper problems in linear and quadratic programming

    Trudy Inst. Mat. i Mekh. UrO RAN, 1 (1992),  178–192
  25. Symmetric duality for problems of sequential linear programming

    Dokl. Akad. Nauk SSSR, 317:5 (1991),  1045–1048
  26. Questions of duality for improper problems of mathematical programming

    Algebra Logika, 23:6 (1984),  624–636
  27. Duality for nonproper problems in linear programming

    Mat. Zametki, 32:2 (1982),  229–238
  28. Duality for improper problems of linear and convex programming

    Dokl. Akad. Nauk SSSR, 256:2 (1981),  272–276
  29. Standard iterative processes of unsmooth optimization for non-stationary problems of convex programming. II

    Zh. Vychisl. Mat. Mat. Fiz., 19:1 (1979),  112–120
  30. Standard iteration processes of nonsmooth optimization for nonstationary convex programming problems. I

    Zh. Vychisl. Mat. Mat. Fiz., 18:6 (1978),  1430–1442
  31. Discrete processes of Fejér type for nondifferentiable convex programming problems

    Algebra Logika, 15:6 (1976),  628–641
  32. Problems of successive programming

    Sibirsk. Mat. Zh., 14:1 (1973),  53–63
  33. Fejér transformations and a problem of convex programming

    Sibirsk. Mat. Zh., 10:5 (1969),  1034–1047
  34. 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
  35. On the speed of convergence in the method of Fejer approximations

    Mat. Zametki, 4:1 (1968),  53–61
  36. Methods of fejer's approximations in convex programming

    Mat. Zametki, 3:2 (1968),  217–234
  37. The method of “penalties” in convex programming

    Dokl. Akad. Nauk SSSR, 173:4 (1967),  748–751
  38. The penalty method in linear programming and its realization on a computer

    Zh. Vychisl. Mat. Mat. Fiz., 7:6 (1967),  1358–1366
  39. Iteration method for solving problems of convex programming

    Dokl. Akad. Nauk SSSR, 170:1 (1966),  57–60
  40. On systems of inequalities with convex functions in the left-hand sides

    Izv. Akad. Nauk SSSR Ser. Mat., 30:2 (1966),  265–278
  41. 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
  42. Generalization of the relaxation method of Motzkin and Agmon

    Uspekhi Mat. Nauk, 20:2(122) (1965),  183–187
  43. An iterative method for Chebyshev approximations of incompatible systems of linear inequalities

    Dokl. Akad. Nauk SSSR, 143:6 (1962),  1254–1256
  44. Incompatible systems of linear inequalities

    Dokl. Akad. Nauk SSSR, 138:6 (1961),  1280–1283
  45. Groups with finite classes of conjugate subgroups with a given property

    Dokl. Akad. Nauk SSSR, 137:4 (1961),  772–773
  46. On central extensions by means of thin layer-finite groups

    Izv. Vyssh. Uchebn. Zaved. Mat., 1960, no. 2,  93–95
  47. Groups with finite classes of conjugate abelian subgroups

    Mat. Sb. (N.S.), 47(89):1 (1959),  45–54
  48. Groups with finite classes of conjugate Abelian subgroups

    Dokl. Akad. Nauk SSSR, 118:2 (1958),  223–224
  49. On some properties of nodes of a system of linear inequalities

    Uspekhi Mat. Nauk, 11:2(68) (1956),  169–172

  50. On the 100th birthday of Sergei Nikolaevich Chernikov

    Trudy Inst. Mat. i Mekh. UrO RAN, 18:3 (2012),  5–9
  51. 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
  52. XXII All-Russian Conference "Mathematical Programming and Applications"

    Avtomat. i Telemekh., 2004, no. 2,  4–6
  53. Problems of the modern optimization theory

    Avtomat. i Telemekh., 2004, no. 2,  3
  54. Sergei Nikolaevich Chernikov (on his sixtieth birthday)

    Uspekhi Mat. Nauk, 28:1(169) (1973),  259–260
  55. A. Jaeger, Ê. Wenke. Lineare Wirtschaftsalgebra. Stuttgart, Teubner, 1969, X+334S. (Book review)

    Zh. Vychisl. Mat. Mat. Fiz., 10:5 (1970),  1327–1328
  56. Lineares optimieren: W. Vogel. Akad. Verlag, Leipzig. 372 S., 1967

    Zh. Vychisl. Mat. Mat. Fiz., 9:6 (1969),  1427
  57. 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
  58. 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

© Steklov Math. Inst. of RAS, 2024