Ivan Ivanovich Eremin

V. I. Berdyshev   ; V. V. Vasin   ; S. V. Matveev   ; A. A. Makhnev   ; Yu. N. Subbotin   ; N. N. Subbotina   ; V. N. Ushakov   ; M. Yu. Khachai   ; A. G. Chentsov

Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 20 (2014) no. 2, pp. 5-12

Bibliographie

[1] “O nekotorykh svoistvakh uzlov sistemy lineinykh neravenstv”, Uspekhi mat. nauk, 11:2 (1956), 169–172 | MR | Zbl

[2] “Gruppy s konechnymi klassami sopryazhennykh abelevykh podgrupp”, Dokl. AN SSSR, 118:2 (1958), 223–224 | Zbl

[3] “Gruppy s konechnymi klassami sopryazhennykh abelevykh podgrupp”, Mat. sb., 47(89):1 (1959), 45–54 | MR | Zbl

[4] Gruppy s konechnymi klassami sopryazhennykh abelevykh podgrupp, Avtoref. dis. $\dots$ kand. fiz.-mat. nauk, Izd-vo Perm. gos. un-ta, Perm, 1959, 7 pp.

[5] “O tsentralnykh rasshireniyakh s pomoschyu tonkikh sloinokonechnykh grupp”, Izv. vuzov. Matematika, 1960, no. 2, 93–95 | MR | Zbl

[6] “O gruppakh s konechnymi klassami sopryazhennykh podgrupp s zadannym svoistvom”, Dokl. AN SSSR, 137:4 (1961), 772–773 | Zbl

[7] “O nesovmestnykh sistemakh lineinykh neravenstv”, Dokl. AN SSSR, 138:6 (1961), 1280–1283 | MR | Zbl

[8] “Iterativnyi metod dlya chebyshevskikh priblizhenii nesovmestnykh sistem lineinykh neravenstv”, Dokl. AN SSSR, 143:6 (1962), 1254–1256 | Zbl

[9] “Obobschenie relaksatsionnogo metoda Motskina–Agmona”, Uspekhi mat. nauk, 20:2 (1965), 183–187 | MR | Zbl

[10] “Relaksatsionnyi metod resheniya sistem neravenstv s vypuklymi funktsiyami v levykh chastyakh”, Dokl. AN SSSR, 160:5 (1965), 994–996 | Zbl

[11] “Iteratsionnyi metod resheniya zadachi vypuklogo programmirovaniya”, Mat. zap. Ural. gos. un-ta, 5:3 (1965), 40–48, (sovm. c Vl. D. Mazurovym)

[12] “O sistemakh neravenstv s vypuklymi funktsiyami v levykh chastyakh”, Izv. AN SSSR. Ser. Matematika, 30:2 (1966), 265–278 | MR | Zbl

[13] “O nekotorykh iteratsionnykh metodakh v vypuklom programmirovanii”, Ekonomika i mat. metody, 2:6 (1966), 870–886

[14] “Iterativnyi metod resheniya zadachi vypuklogo programmirovaniya”, Dokl. AN SSSR, 170:1 (1966), 57–60, (sovm. c Vl. D. Mazurovym) | Zbl

[15] “O metode shtrafov v vypuklom programmirovanii”, Tez. 15-go Mezhdunar. kongr. matematikov (Moskva, 16–26 avgusta 1966 g.), Cektsiya 14, Moskva, 1966, 34

[16] Optimizatsiya toplivno-energeticheskogo balansa, RISO UFAN, Sverdlovsk, 1966, 100 pp., (sovm. s N. M. Vilenskim, Z. S. Drugalevoi i dr.)

[17] “O metode shtrafov v vypuklom programmirovanii”, Kibernetika, 1967, no. 4, 63–67

[18] “Metod shtrafov v vypuklom programmirovanii”, Dokl. AN SSSR, 173:4 (1967), 748–751 | MR | Zbl

[19] “Metod shtrafov v lineinom programmirovanii i ego realizatsiya”, Zhurn. vychisl. matematiki i mat. fiziki, 7:6 (1967), 1358–1366, (sovm. s M. A. Kostinoi) | Zbl

[20] “Metod feierovskikh priblizhenii v vypuklom programmirovanii”, Mat. zametki, 3:2 (1968), 217–234 | MR

[21] “O skorosti skhodimosti v metode feierovskikh priblizhenii”, Mat. zametki, 4:1 (1968), 53–61 | MR | Zbl

[22] “Primenenie metoda feierovskikh priblizhenii k resheniyu zadach vypuklogo programmirovaniya s negladkimi ogranicheniyami”, Zhurn. vychisl. matematiki i mat. fiziki, 9:5 (1969), 1153–1160 | MR | Zbl

[23] “Feierovskie otobrazheniya i zadacha vypuklogo programmirovaniya”, Sib. mat. zhurn., 10:5 (1969), 1034–1047 | Zbl

[24] Vvedenie v lineinoe i vypukloe programmirovanie, Ucheb. posobie, Izd-vo Ural. gos. un-ta, Sverdlovsk, 1970, 128 pp.

[25] “O zadachakh vypuklogo programmirovaniya s protivorechivymi ogranicheniyami”, Kibernetika, 1971, no. 4, 124–129

[26] “O zadachakh posledovatelnogo programmirovaniya”, Sib. mat. zhurn., 14:1 (1973), 53–63 | Zbl

[27] “Sistemy lineinykh neravenstv i nekotorye prilozheniya”, Ukr. mat. zhurn., 25:4 (1973), 465–478, (sovm. s N. N. Krasovskim)

[28] Osnovy lineinogo i vypuklogo programmirovaniya, Ucheb. posobie, Izd-vo Ural. gos. un-ta, Sverdlovsk, 1973, 145 pp.

[29] “Nestatsionarnye protsessy matematicheskogo programmirovaniya”, Uspekhi mat. nauk, 29:5 (1974), 254–256, (sovm. c Vl. D. Mazurovym) | MR

[30] Vvedenie v teoriyu lineinogo i vypuklogo programmirovaniya, Nauka, M., 1976, 192 pp., (sovm. s N. N. Astafevym) | MR

[31] “Sintez i analiz nestatsionarnykh protsessov matematicheskogo programmirovaniya, ikh prilozheniya v ekonomike i tekhnike”, Ekonomicko-matematicky obzor. C̆eskoslovenská Akademie Vĕd., 12:3 (1976), 277–293, (sovm. c Vl. D. Mazurovym) | MR | Zbl

[32] “Diskretnye protsessy feierovskogo tipa dlya negladkikh zadach vypuklogo programmirovaniya”, Algebra i logika, 15:6 (1976), 628–641 | MR | Zbl

[33] “Iteratsionnyi metod obucheniya diskriminatsii beskonechnykh mnozhestv”, Kibernetika, 1977, no. 5, 108–110, (sovm. c Vl. D. Mazurovym)

[34] “Standartnye iteratsionnye protsessy negladkoi optimizatsii dlya nestatsionarnykh zadach vypuklogo programmirovaniya, I”, Zhurn. vychisl. matematiki i mat. fiziki, 18:6 (1978), 1430–1442 | MR | Zbl

[35] “Standartnye iteratsionnye protsessy negladkoi optimizatsii dlya nestatsionarnykh zadach vypuklogo programmirovaniya, II”, Zhurn. vychisl. matematiki i mat. fiziki, 19:1 (1979), 112–120 | MR | Zbl

[36] Voprosy optimizatsii i raspoznavaniya obrazov, Sred.-Ural. kn. izd-vo, Sverdlovsk, 1979, 64 pp., (sovm. c Vl. D. Mazurovym)

[37] Nestatsionarnye protsessy matematicheskogo programmirovaniya, Nauka, M., 1979, 288 pp., (sovm. c Vl. D. Mazurovym) | MR

[38] “Avtomatizatsiya upravleniya parametrami iteratsionnogo protsessa dlya zadach matematicheskogo programmirovaniya”, Kibernetika, 1979, no. 6, 41–45, (sovm. c Vl. D. Mazurovym)

[39] “Dvoistvennost dlya nesobstvennykh zadach lineinogo i vypuklogo programmirovaniya”, Dokl. AN SSSR, 256:2 (1981), 272–276 | MR | Zbl

[40] Dvoistvennost dlya nesobstvennykh zadach lineinogo i vypuklogo programmirovaniya, UNTs AN SSSR, Sverdlovsk, 1981, 44 pp.

[41] “Dvoistvennost dlya nesobstvennykh zadach lineinogo programmirovaniya”, Mat. zametki, 32:2 (1982), 229–238 | MR | Zbl

[42] “Dvoistvennost dlya nesobstvennykh zadach lineinogo i vypuklogo programmirovaniya i metody ikh korrektsii”, Izv. AN SSSR. Tekhn. kibernetika, 1983, no. 1, 20–32

[43] Nesobstvennye zadachi lineinogo i vypuklogo programmirovaniya, Nauka, M., 1983, 336 pp., (sovm. s Vl. D. Mazurovym, N. N. Astafevym) | MR

[44] “Dvoistvennost dlya nesobstvennykh beskonechnomernykh zadach lineinogo i vypuklogo programmirovaniya”, Metody approksimatsii nesobstvennykh zadach matematicheskogo programmirovaniya, Sb. st., eds. I. I. Eremin, V. D. Skarin, UNTs AN SSSR, Sverdlovsk, 1984, 3–20, (sovm. s A. A. Vatolinym) | MR

[45] “Voprosy dvoistvennosti dlya nesobstvennykh zadach matematicheskogo programmirovaniya”, Algebra i logika, 23:6 (1984), 624–635 | MR

[46] “Nesobstvennye zadachi kvadratichnogo programmirovaniya i voprosy regulyarizatsii”, Parametricheskaya optimizatsiya i metody approksimatsii nesobstvennykh zadach matematicheskogo programmirovaniya, Sb. st., eds. I. I. Eremin, L. D. Popov, UNTs AN SSSR, Sverdlovsk, 1985, 47–50 | MR

[47] Dvoistvennost dlya nesobstvennykh zadach matematicheskogo programmirovaniya, UNTs AN SSSR, Sverdlovsk, 1985, 50 pp., (sovm. s A. A. Vatolinym)

[48] Protivorechivye modeli ekonomiki, Sred.-Ural. kn. izd-vo, Sverdlovsk, 1986, 96 pp. | MR

[49] “Dvoistvennost i approksimatsiya dlya nesobstvennykh zadach matematicheskogo programmirovaniya”, Izv. AN SSSR. Tekhn. kibernetika, 1987, no. 1, 70–81

[50] “Voprosy dvoistvennosti dlya nesobstvennykh zadach mnogokriterialnoi lineinoi optimizatsii”, Issledovaniya po nesobstvennym zadacham optimizatsii, Sb. st., eds. I. I. Eremin, A. A. Vatolin, Izd-vo UrO AN SSSR, Sverdlovsk, 1988, 27–33

[51] “Sistemy lineinykh neravenstv v matematicheskom programmirovanii i raspoznavanii obrazov”, Ukr. mat. zhurn., 40:3 (1988), 288–296, (sovm. s Vl. D. Mazurovym, N. N. Astafevym) | MR

[52] Protivorechivye modeli optimalnogo planirovaniya, Nauka, M., 1988, 160 pp. | MR

[53] “Obschaya skhema formirovaniya dvoistvennosti dlya nesobstvennykh zadach matematicheskogo programmirovaniya”, Kibernetika, 1989, no. 5, 79–82

[54] “Improper mathematical programming problems”, Problems of control and information theory, 18:6 (1989), 359–380, (jointly with A. A. Vatolin) | MR | Zbl

[55] “Simmetrichnaya dvoistvennost dlya zadach posledovatelnogo lineinogo programmirovaniya”, Dokl. AN SSSR, 317:5 (1991), 1045–1048 | MR | Zbl

[56] “Simmetricheskaya dvoistvennost dlya leksikograficheskikh zadach lineinogo programmirovaniya”, Ukr. mat. zhurn., 44:6 (1992), 766–773 | Zbl

[57] “Leksikograficheskaya dvoistvennost dlya nesobstvennykh zadach lineinogo i kvadratichnogo programmirovaniya”, Tr. In-ta matematiki i mekhaniki UrO RAN, 1, Ekaterinburg, 1992, 178–192 | MR | Zbl

[58] “Numerical analysis of improper linear programs using the Delta-plan-ES interactive system”, Optimization Methods Software, 2 (1993), 69–78, (jointly with L. D. Popov) | DOI

[59] “Delta-plan-ES – the interactive system of numerical analysis of improper linear programs”, Int. J. of software engineering and knowledge engineering, 3:4 (1993), 429–438, (jointly with L. D. Popov) | DOI

[60] “Improper problems of mathematical programming”, Modern mathematical methods of optimization, Chapter 5, Akademie-Verlag, Berlin, 1993, 178–212, (jointly with A. A. Vatolin, L. D. Popov)

[61] “Dvoistvennost dlya pareto-leksikograficheskikh zadach lineinoi optimizatsii”, Izv. vuzov. Matematika (Kazan), 1993, no. 12(379), 3–10 | MR | Zbl

[62] “Duality for pareto-lexicographic problems of linear optimization”, Pattern Recognition and Image Analysis, 3:4 (1993), 482–487 | Zbl

[63] “Pareto-posledovatelnaya zadacha lineinoi optimizatsii i dvoistvennost”, Dokl. RAN, 334:4 (1994), 141–143 | MR | Zbl

[64] “Konechnyi iteratsionnyi metod nakhozhdeniya vnutrennei tochki algebraicheskogo mnogogrannika i otsenka chisla shagov”, Izv. vuzov. Matematika (Kazan), 1995, no. 12, 19–25 | MR | Zbl

[65] “Summetric duality in lexicographic problems of linear optimization”, Yugoslav J. of Operations Research (Belgrade), 5:2 (1995), 165–172 | MR | Zbl

[66] “Dvoistvennost dlya zadach diskriminatsii i taksonomii sistem lineinykh neravenstv”, Pattern Recognition and Image Analysis, 5:3 (1995), 233–236

[67] “Dvoistvennost dlya Pareto-posledovatelnykh zadach lineinogo programmirovaniya”, Tr. In-ta matematiki i mekhaniki UrO RAN, 3, Ekaterinburg, 1995, 245–260 | MR | Zbl

[68] “K metodu shtrafov v matematicheskom programmirovanii”, Dokl. RAN, 346:4 (1996), 459–461 | MR | Zbl

[69] “Dvoistvennost dlya nesobstvennykh zadach paretovskoi i leksikograficheskoi lineinoi optimizatsii”, Tr. In-ta matematiki i mekhaniki UrO RAN, 4, Ekaterinburg, 1996, 322–336 | MR | Zbl

[70] “Nekotorye voprosy kusochno-lineinogo programmirovaniya”, Izv. vuzov. Matematika (Kazan), 1997, no. 12(427), 49–61 | MR | Zbl

[71] “About some problems of disjunctive programming”, Yugoslav J. of Operations Research (Belgrade), 8:1 (1998), 25–43 | MR | Zbl

[72] “Sigma-kusochnye funktsii i zadachi diz'yunktivnogo programmirovaniya”, Dokl. RAN, 358:5 (1998), 588–590 | MR

[73] “Sigma-kusochnye funktsii i zadachi diz'yunktivnogo programmirovaniya”, Tr. In-ta matematiki i mekhaniki UrO RAN, 5, Ekaterinburg, 1998, 357–380 | Zbl

[74] Teoriya lineinoi optimizatsii, Izd-vo UrO RAN, Ekaterinburg, 1998, 248 pp.

[75] “O kvadratichnykh i polnokvadratichnykh zadachakh vypuklogo programmirovaniya”, Izv. vuzov. Matematika (Kazan), 1998, no. 12, 22–28 | MR | Zbl

[76] “Dvoistvennost dlya zadach kvadratichnogo programmirovaniya v gilbertovom prostranstve”, Inform. byull. AMP (Ekaterinburg), 1999, no. 8, 99–102

[77] Teoriya lineinoi optimizatsii, Izd-vo “Ekaterinburg”, Ekaterinburg, 1999, 312 pp.

[78] “Obschaya teoriya ustoichivosti v lineinom programmirovanii”, Izv. vuzov. Matematika (Kazan), 1999, no. 12(451), 43–52 | MR | Zbl

[79] Matematicheskie metody v ekonomike, Sb. st., eds. I. I. Eremin, Vl. D. Mazurov, U-Faktoriya, Ekaterinburg, 2000, 280 pp., (sovm. s Vl. D. Mazurovym, V. D. Skarinym, M. Yu. Khachaem)

[80] “About the problem of disjunctive programming”, Yugoslav J. of Operations Research (Belgrade), 10:2 (2000), 149–161 | MR | Zbl

[81] “Annotatsii prioritetnykh rezultatov v oblasti matematicheskogo programmirovaniya”, Inform. byul. AMP, I (Ekaterinburg), 2001, no. 9, 58–66

[82] Dvoistvennost v lineinoi optimizatsii, Izd-vo UrO RAN, Ekaterinburg, 2001, 180 pp.

[83] “Sintez feierovskikh otobrazhenii s nesovpadayuschimi prostranstvami ikh obrazov”, Dokl. RAN, 378:1 (2001), 11–13 | MR | Zbl

[84] “About disjunctive optimization”, Semi-infinite programming, eds. M. Á. Goberna, M. A. López, Kluwer Academic Publishers, Netherlands, 2001, 45–58 | MR | Zbl

[85] Theory of linear optimization, Inverse and ill-posed problems ser., VSP, Utrecht–Boston–Kőln–Tokyo, 2002, 248 pp. | MR

[86] “Parallelnye feierovskie metody dlya silno strukturirovannykh sistem lineinykh neravenstv i uravnenii”, Algoritmy i program. obespechenie paral. vychislenii, 6, Izd-vo UrO RAN, Ekaterinburg, 2002, 149–175, (sovm. s L. D. Popovym)

[87] “Feierovskie protsessy dlya beskonechnykh sistem vypuklykh neravenstv”, Tr. In-ta matematiki i mekhaniki UrO RAN, 8, no. 1, Ekaterinburg, 2002, 45–65, (sovm. s S. V. Patsko) | MR | Zbl

[88] “Fejér processes for infinite systems of convex inequalities”, Proc. Steklov Inst. Math., Suppl. 1, 2002, S32–S51, (jointly with S. V. Patsko) | MR | Zbl

[89] “Voprosy ustoichivosti i regulyarizatsii nesobstvennykh zadach lineinogo programmirovaniya”, Izv. Ural. gos. un-ta. Ser. Matematika. Mekhanika, 2003, no. 30(6), 1–25, (sovm. s D. A. Makarovoi, L. V. Shults)

[90] “Feierovskie metody dekompozitsii silno strukturirovannykh sistem lineinykh neravenstv”, Algoritmy i program. obespechenie paral. vychislenii, 7, Izd-vo UrO RAN, Ekaterinburg, 2003, 3–20, (sovm. s L. D. Popovym, E. A. Berdnikovoi)

[91] “Simmetrichnaya dvoistvennost dlya leksikograficheskoi zadachi lineinogo programmirovaniya”, Ekonomiko-matematicheskii entsiklopedicheskii slovar, INFRA-M, M., 2003, 113–114

[92] “Nesobstvennye zadachi matematicheskogo programmirovaniya”, Ekonomiko-matematicheskii entsiklopedicheskii slovar, INFRA-M, M., 2003, 334–335, (sovm. s Vl. D. Mazurovym)

[93] “Raspredelennye feierovskie protsessy dlya sistem lineinykh neravenstv i zadach lineinogo programmirovaniya”, Avtomatika i telemekhanika, 2004, no. 2, 16–32, (sovm. s L. D. Popovym, E. A. Berdnikovoi) | MR | Zbl

[94] “Feierovskie protsessy: sintez i randomizatsiya”, Tr. In-ta matematiki i mekhaniki UrO RAN, 10, no. 2, Ekaterinburg, 2004, 58–68 | MR | Zbl

[95] “Identifikatsiya shtrafnykh konstant v metodakh tochnykh shtrafnykh funktsii”, Dokl. RAN, 402:6 (2005), 737–739 | MR | Zbl

[96] Operatory i iteratsionnye protsessy feierovskogo tipa. Teoriya i prilozheniya, NITs “Regulyarnaya i khaoticheskaya dinamika”, M.–Izhevsk, 2005, 200 pp., (sovm. s V. V. Vasinym) | MR

[97] Teoriya dvoistvennosti v lineinoi optimizatsii, Izd-vo Yuzh.-Ural. gos. un-ta, Chelyabinsk, 2005, 195 pp.

[98] “Pryamo-dvoistvennye metody feierovskogo tipa dlya zadach kvadratichnogo programmirovaniya”, Optimizatsiya, upravlenie, intellekt (Irkutsk), 2005, no. 1(9), 36–46

[99] “Pryamo-dvoistvennye feierovskie metody dlya zadach kvadratichnogo programmirovaniya”, Tr. In-ta matematiki i mekhaniki UrO RAN, 12, no. 1, Ekaterinburg, 2006, 86–97 | MR | Zbl

[100] “Direct-dual Fejér methods for problems of quadratic programming”, Dynamical systems: modeling, optimiz., and control, Proc. Steklov Inst. Math., 253, Suppl. 1, 2006, S83–S95 | MR | Zbl

[101] “Iterativnaya otdelimost neperesekayuschikhsya mnogogrannikov”, Tr. Mezhdunar. seminara, posvyasch. 60-letiyu A. N. Subbotina (Ekaterinburg, Rossiya, 22–26 iyunya 2005 g.), v. 2, Izd-vo Ural. gos. un-ta, Ekaterinburg, 2006, 16–24

[102] “Feierovskie metody silnoi otdelimosti vypuklykh poliedralnykh mnozhestv”, Izv. vuzov. Matematika, 2006, no. 12(535), 33–43 | MR

[103] Sistemy lineinykh neravenstv i lineinaya optimizatsiya, Izd-vo UrO RAN, Ekaterinburg, 2007, 338 pp.

[104] Lineinaya optimizatsiya i sistemy lineinykh neravenstv, Akademiya, M., 2007, 249 pp.

[105] “Zamknutye feierovskie tsikly dlya nesovmestnykh sistem vypuklykh neravenstv”, Izv. vuzov. Matematika, 2008, no. 1(548), 11–19, (sovm. s L. D. Popovym) | MR

[106] “Avtorskie rezultaty po problematike matematicheskogo programmirovaniya v retrospektive”, Tr. In-ta matematiki i mekhaniki UrO RAN, 14, no. 2, 2008, 58–66 | Zbl

[107] “Author's results on mathematical programming in retrospect”, Proc. Steklov Inst. Math., 263, Suppl. 2, 2008, S47–S56 | Zbl

[108] “Feierovskie protsessy v teorii i praktike: obzor poslednikh rezultatov”, Izv. vuzov. Matematika, 2009, no. 1, 44–65, (sovm. s L. D. Popovym) | MR | Zbl

[109] Operators and iterative processes of Fejér type. Theory and applications, Inverse and ill-posed problems ser., Walter de Gruyter, Berlin–New York, 2009, 155 pp., (jointly with V. V. Vasin) | MR

[110] “Otobrazheniya szhatiya”, Tr. In-ta matematiki i mekhaniki UrO RAN, 15, no. 3, 2009, 106–115

[111] “Contraction mappings”, Proc. Steklov Inst. Math, 268, Suppl. 1, 2010, S85–S94 | MR

[112] Feierovskie metody dlya zadach vypukloi i lineinoi optimizatsii, Izd-vo Yuzh.-Ural. gos. un-ta, Chelyabinsk, 2009, 199 pp.

[113] “Metody resheniya sistem lineinykh i vypuklykh neravenstv, osnovannye na printsipe Feiera”, Tr. In-ta matematiki i mekhaniki UrO RAN, 16, no. 3, 2010, 67–77

[114] “Methods for solving systems of linear and convex inequalities based on the Fejér principle”, Proc. Steklov Inst. Math., 272, Suppl. 1, 2011, S36–S45

[115] “Vnutrennie shtrafnye funktsii i dvoistvennost v lineinom programmirovanii”, Tr. In-ta matematiki i mekhaniki UrO RAN, 18, no. 3, 2012, 83–89, (sovm. s L. D. Popovym)

[116] “2-priblizhennyi algoritm poiska kliki s minimalnym vesom vershin i reber”, Tr. In-ta matematiki i mekhaniki UrO RAN, 19, no. 2, 2013, 134–143, (sovm. s E. Kh. Gimadi, A. V. Kelmanovym, A. V. Pyatkinym, M. Yu. Khachaem)

[117] “2-approximation algorithm for finding a clique with minimum weight of vertices and edges”, Proc. Steklov Inst. Math., 284, Suppl. 1, 2014, S87–S95, (jointly with E. Kh. Gimadi, A. V. Kel'manov, A. V. Pyatkin, M. Yu. Khachai)