RUS  ENG JOURNALS   PERSONS   ORGANISATIONS   CONFERENCES   VIDEO LIBRARY   PERSONAL OFFICE   LIBRARY
 
Eremin Ivan Ivanovich

Statistics Math-Net.Ru
Total publications: 26
Scientific articles: 25
Citations to the author: 20
Cited articles: 15
Citing authors: 7

Number of views:
This page:308
Abstract pages:1129
Full texts:439
References:21
Academic status: Member of the Russian Academy of Sciences
Scientific degree: Doctor of physico-mathematical sciences
E-mail:
UDC: 519.9, 519.853, 519.3, 518, 519.6, 519.677, 519.85, 519.852
MSC: 90С25

List of publications on Google Scholar
List of publications on ZentralBlatt
Personal webpage on MathSciNet

Publications in Math-Net.Ru
1. Fejér processes in theory and practice: recent results
I. I. Eremin, L. D. Popov
Izv. Vyssh. Uchebn. Zaved. Mat., 2009:1, 44–65
2. Contraction mapping
I. I. Eremin
Tr. Inst. Mat. Mekh., 2009, 15:3, 106–115
3. Closed Fejér cycles for incompatible systems of convex inequalities
I. I. Eremin, L. D. Popov
Izv. Vyssh. Uchebn. Zaved. Mat., 2008:1, 11–19
4. Author’s results on Mathematical Programming in retrospect
I. I. Eremin
Tr. Inst. Mat. Mekh., 2008, 14:2, 58–66
5. Fejér methods for the strong separability of convex polyhedral sets
I. I. Eremin
Izv. Vyssh. Uchebn. Zaved. Mat., 2006:12, 33–43
6. Direct-dual Fejér methods for problems of quadratic programming
I. I. Eremin
Tr. Inst. Mat. Mekh., 2006, 12:1, 86–97
7. Fejér processes: synthesis and randomization
I. I. Eremin
Tr. Inst. Mat. Mekh., 2004, 10:2, 58–68
8. Fejér processes for infinite systems of convex inequalities
I. I. Eremin, S. V. Patsko
Tr. Inst. Mat. Mekh., 2002, 8:1, 45–65
9. General theory of stability in linear programming
I. I. Eremin
Izv. Vyssh. Uchebn. Zaved. Mat., 1999:12, 43–52
10. On quadratic and fully quadratic problems of convex programming
I. I. Eremin
Izv. Vyssh. Uchebn. Zaved. Mat., 1998:12, 22–28
11. Sigma-piecewise functions and problems of disjunctive programming
I. I. Eremin
Tr. Inst. Mat. Mekh., 1998, 5357–380
12. Some questions of piecewise linear programming
I. I. Eremin
Izv. Vyssh. Uchebn. Zaved. Mat., 1997:12, 49–61
13. Duality for improper problems of Pareto and lexicographic linear optimization
I. I. Eremin
Tr. Inst. Mat. Mekh., 1996, 4322–336
14. A finite iterative method for finding an interior point of an algebraic polyhedron, and estimation of the number of steps
I. I. Eremin
Izv. Vyssh. Uchebn. Zaved. Mat., 1995:12, 19–25
15. The duality for Pareto-successive linear optimization problems
I. I. Eremin
Tr. Inst. Mat. Mekh., 1995, 3245–260
16. Duality for Pareto-sequential problems of linear optimization
I. I. Eremin
Izv. Vyssh. Uchebn. Zaved. Mat., 1993:12, 3–10
17. The lexicographic duality for improper problems in linear and quadratic programming
I. I. Eremin
Tr. Inst. Mat. Mekh., 1992, 1178–192
18. Duality for nonproper problems in linear programming
I. I. Eremin
Mat. Zametki, 1982, 32:2, 229–238
19. On the speed of convergence in the method of Fejer approximations
I. I. Eremin
Mat. Zametki, 1968, 4:1, 53–61
20. Methods of fejer's approximations in convex programming
I. I. Eremin
Mat. Zametki, 1968, 3:2, 217–234
21. On systems of inequalities with convex functions in the left-hand sides
I. I. Eremin
Izv. Akad. Nauk SSSR Ser. Mat., 1966, 30:2, 265–278
22. Generalization of the relaxation method of Motzkin and Agmon
I. I. Eremin
Uspekhi Mat. Nauk, 1965, 20:2(122), 183–187
23. On central extensions by means of thin layer-finite groups
I. I. Eremin
Izv. Vyssh. Uchebn. Zaved. Mat., 1960:2, 93–95
24. Groups with finite classes of conjugate abelian subgroups
I. I. Eremin
Mat. Sb. (N.S.), 1959, 47(89):1, 45–54
25. On some properties of nodes of a system of linear inequalities
I. I. Eremin
Uspekhi Mat. Nauk, 1956, 11:2(68), 169–172

26. Sergei Nikolaevich Chernikov (on his sixtieth birthday)
I. I. Eremin, D. I. Zaitsev, M. I. Kargapolov, V. S. Charin
Uspekhi Mat. Nauk, 1973, 28:1(169), 259–260

Organisations
 
Contact us:
 Terms of Use  Registration © Steklov Mathematical Institute RAS, 2010
© Branch of Mathematical Sciences, Russian Academy of Sciences, 2010