E. A. Nurminski, “Equivalence relations in convex optimization”, Diskretn. Anal. Issled. Oper., 30:2 (2023), 81–90
2.
E. A. Nurminski, “A Bicomposition of Conical Projections”, Trudy Inst. Mat. i Mekh. UrO RAN, 29:3 (2023), 73–87; Proc. Steklov Inst. Math. (Suppl.), 323, suppl. 1 (2023), S179–S193
2022
3.
E. A. Nurminskiy, N. B. Shamray, “Modeling and optimizing large-scale production-level transportation systems”, Diskretn. Anal. Issled. Oper., 29:3 (2022), 64–84
2021
4.
A. V. Zatserkovnyy, E. A. Nurminski, “Neural network analysis of transportation flows of urban aglomeration using the data from public video cameras”, Computer Research and Modeling, 13:2 (2021), 305–318
E. A. Vorontsova, A. V. Gasnikov, A. S. Ivanova, E. A. Nurminsky, “The Walrasian equilibrium and centralized distributed optimization in terms of modern convex optimization methods on the example of resource allocation problem”, Sib. Zh. Vychisl. Mat., 22:4 (2019), 415–436; Num. Anal. Appl., 12:4 (2019), 338–358
E. A. Nurminskii, D. Tien, “Method of conjugate subgradients with constrained memory”, Avtomat. i Telemekh., 2014, no. 4, 67–80; Autom. Remote Control, 75:4 (2014), 646–656
E. A. Nurminski, A. A. Bury, “The Parker–Sochacki method for solving systems of ordinary differential equations using graphics processors”, Sib. Zh. Vychisl. Mat., 14:3 (2011), 277–289; Num. Anal. Appl., 4:3 (2011), 223–233
E. A. Nurminski, “The use of additional diminishing disturbances in Fejer models of iterative algorithms”, Zh. Vychisl. Mat. Mat. Fiz., 48:12 (2008), 2121–2128; Comput. Math. Math. Phys., 48:12 (2008), 2154–2161
E. A. Nurminski, N. B. Shamraĭ, “A method of local convex majorants for solving variational-like inequalities”, Zh. Vychisl. Mat. Mat. Fiz., 47:3 (2007), 355–363; Comput. Math. Math. Phys., 47:3 (2007), 341–348
D. V. Dolgy, E. A. Nurminski, “An accelerated parallel projection method for solving the minimum length problem”, Num. Meth. Prog., 7:3 (2006), 273–277
E. A. Nurminski, “Convergence of the suitable affine subspace method for finding the least distance to a simplex”, Zh. Vychisl. Mat. Mat. Fiz., 45:11 (2005), 1991–1999; Comput. Math. Math. Phys., 45:11 (2005), 1915–1922
A. S. Velichko, E. A. Nurminski, “Portfolio replication: its forward-dual decomposition”, Avtomat. i Telemekh., 2004, no. 2, 170–178; Autom. Remote Control, 65:2 (2004), 311–318
E. A. Nurminski, “A parallel method of projection onto the convex hull of a family of sets”, Izv. Vyssh. Uchebn. Zaved. Mat., 2003, no. 12, 78–82; Russian Math. (Iz. VUZ), 47:12 (2003), 74–78
S. K. Andrusenko, E. A. Nurminskii, P. I. Stetsyuk, “Numerical experiments in a new class of algorithms in linear programming”, Zh. Vychisl. Mat. Mat. Fiz., 27:3 (1987), 349–356; U.S.S.R. Comput. Math. Math. Phys., 27:2 (1987), 18–22
1986
18.
E. A. Nurminskii, “A class of convex programming methods”, Zh. Vychisl. Mat. Mat. Fiz., 26:8 (1986), 1150–1159; U.S.S.R. Comput. Math. Math. Phys., 26:4 (1986), 122–128
Contact us: