Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Zabotin, Igor Yarovlavich
Statistics Math-Net.Ru
Total publications: 30
Scientific articles: 30

Number of views:
This page:829
Abstract pages:6130
Full texts:2510
References:600
Professor
Doctor of physico-mathematical sciences (2010)
Speciality: 01.01.09 (Discrete mathematics and mathematical cybernetics)
E-mail: ,
Website: http://www.ksu.ru/persons/9117.ru.html

https://www.mathnet.ru/eng/person34066
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/197037

Publications in Math-Net.Ru Citations
2023
1. I. Ya. Zabotin, K. E. Kazaeva, O. N. Shul'gina, “A cutting-plane method with internal iteration points for the general convex programming problem”, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 165:3 (2023),  208–218  mathnet
2. I. Ya. Zabotin, O. N. Shulgina, R. S. Yarullin, “A relaxed version of the cutting method with approximation of the constraint region”, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 165:2 (2023),  143–152  mathnet
2019
3. I. Ya. Zabotin, K. E. Kazaeva, “A version of the penalty method with approximation of the epigraphs of auxiliary functions”, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 161:2 (2019),  263–273  mathnet  elib 2
2016
4. I. Ya. Zabotin, O. N. Shul'gina, R. S. Yarullin, “Minimization method with approximation of constraint zone and epigraph of objective function”, Izv. Vyssh. Uchebn. Zaved. Mat., 2016, no. 11,  91–96  mathnet; Russian Math. (Iz. VUZ), 60:11 (2016), 78–81  isi  scopus 7
2015
5. I. Ya. Zabotin, R. S. Yarullin, “Cutting-plane method based on epigraph approximation with discarding the cutting planes”, Avtomat. i Telemekh., 2015, no. 11,  76–88  mathnet  elib; Autom. Remote Control, 76:11 (2015), 1966–1975  isi  elib  scopus 14
2014
6. I. Ya. Zabotin, R. S. Yarullin, “A cutting method with updating approximating sets and its combination with other algorithms”, Bulletin of Irkutsk State University. Series Mathematics, 10 (2014),  13–26  mathnet
7. I. Ya. Zabotin, O. N. Shulgina, R. S. Yarullin, “A cutting method and construction of mixed minimization algorithms on its basis”, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 156:4 (2014),  14–24  mathnet 2
2013
8. I. Ya. Zabotin, R. S. Yarullin, “One approach to constructing cutting algorithms with dropping of cutting planes”, Izv. Vyssh. Uchebn. Zaved. Mat., 2013, no. 3,  74–79  mathnet; Russian Math. (Iz. VUZ), 57:3 (2013), 60–64  scopus 15
9. I. Ya. Zabotin, R. S. Yarullin, “A cutting plane algorithm with an approximation of an epigraph”, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 155:4 (2013),  48–54  mathnet 4
10. I. Ya. Zabotin, R. S. Yarullin, “A Cutting-Plane Method with Updating of Approximating Sets and Estimates of the Solution Accuracy”, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 155:2 (2013),  54–64  mathnet 3
2011
11. I. Ya. Zabotin, “On the several algorithms of immersion-severances for the problem of mathematical programming”, Bulletin of Irkutsk State University. Series Mathematics, 4:2 (2011),  91–101  mathnet 4
2003
12. I. Ya. Zabotin, “Relaxation algorithms for the conditional minimization of nonsmooth strictly pseudoconvex functions”, Izv. Vyssh. Uchebn. Zaved. Mat., 2003, no. 12,  62–70  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 47:12 (2003), 59–66 1
2000
13. I. Ya. Zabotin, “On the stability of algorithms for the unconditional minimization of pseudoconvex functions”, Izv. Vyssh. Uchebn. Zaved. Mat., 2000, no. 12,  33–48  mathnet  mathscinet  zmath  elib; Russian Math. (Iz. VUZ), 44:12 (2000), 31–46
1998
14. I. Ya. Zabotin, “On an approach to the construction of algorithms for the unconditional minimization of pseudoconvex functions”, Izv. Vyssh. Uchebn. Zaved. Mat., 1998, no. 12,  29–39  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 42:12 (1998), 27–37 1
1997
15. I. Ya. Zabotin, “Second-order algorithm with parametrized directions for conditional optimization problems”, Izv. Vyssh. Uchebn. Zaved. Mat., 1997, no. 12,  62–72  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 41:12 (1997), 60–70
1996
16. I. Ya. Zabotin, “A conditional minimization method with parametric specification of suitable directions”, Izv. Vyssh. Uchebn. Zaved. Mat., 1996, no. 12,  17–29  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 40:12 (1996), 14–26
1995
17. I. Ya. Zabotin, E. A. Knyazev, “A variant of the parametrized method of centers”, Izv. Vyssh. Uchebn. Zaved. Mat., 1995, no. 12,  26–32  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 39:12 (1995), 23–29 3
1993
18. I. Ya. Zabotin, “Algorithms with a combination of active gradients for finding a conditional minimax”, Izv. Vyssh. Uchebn. Zaved. Mat., 1993, no. 12,  52–58  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 37:12 (1993), 52–58
1992
19. I. Ya. Zabotin, “On some descent methods with respect to groups of variables”, Issled. Prikl. Mat., 19 (1992),  24–33  mathnet  mathscinet  zmath; J. Math. Sci., 74:5 (1995), 1219–1224
20. I. Ya. Zabotin, “Methods of descent over groups of variables for a class of constrained minimization problems”, Issled. Prikl. Mat., 18 (1992),  48–59  mathnet  mathscinet  zmath; J. Math. Sci., 73:5 (1995), 550–556
1991
21. I. Ya. Zabotin, A. V. Kobchikov, “On the Realization of Some Methods Applied to Design Optimization Problems”, Avtomat. i Telemekh., 1991, no. 1,  169–172  mathnet 2
1989
22. I. Ya. Zabotin, “Minimization of a maximum function of a special kind”, Issled. Prikl. Mat., 16 (1989),  101–108  mathnet  mathscinet  zmath; J. Soviet Math., 61:6 (1992), 2459–2462
1988
23. I. Ya. Zabotin, “Subgradient method to find the saddle point of a convex-concave function”, Issled. Prikl. Mat., 15 (1988),  6–12  mathnet  mathscinet  zmath; J. Soviet Math., 61:5 (1992), 2321–2325 6
1987
24. I. Ya. Zabotin, M. I. Kreinin, “Subgradient relaxation method for minimization of strictly convex functions”, Issled. Prikl. Mat., 14 (1987),  34–42  mathnet  mathscinet  zmath; J. Soviet Math., 50:5 (1990), 1815–1819
1984
25. I. Ya. Zabotin, E. V. Lyamin, “A variant of the constrained gradient method”, Issled. Prikl. Mat., 11:1 (1984),  11–23  mathnet  mathscinet  zmath; J. Soviet Math., 41:4 (1988), 1076–1082
26. I. Ya. Zabotin, “A gradient projection method on an embedding of the feasible set”, Issled. Prikl. Mat., 11:1 (1984),  3–11  mathnet  mathscinet  zmath; J. Soviet Math., 41:4 (1988), 1071–1075
1983
27. I. Ya. Zabotin, A. I. Korablev, “The method of the conditional $\varepsilon$-subgradient”, Izv. Vyssh. Uchebn. Zaved. Mat., 1983, no. 9,  22–26  mathnet  mathscinet  zmath; Soviet Math. (Iz. VUZ), 27:9 (1983), 23–29
1982
28. I. Ya. Zabotin, “Methods for the conditional minimization of functions with best paths of descent relative to the set”, Izv. Vyssh. Uchebn. Zaved. Mat., 1982, no. 7,  11–16  mathnet  mathscinet  zmath; Soviet Math. (Iz. VUZ), 26:7 (1982), 12–19
1981
29. I. Ya. Zabotin, “Choosing descent directions in unconstrained minimization problems”, Issled. Prikl. Mat., 9 (1981),  37–42  mathnet  mathscinet  zmath; J. Soviet Math., 46:6 (1989), 2187–2191 1
1979
30. I. Ya. Zabotin, “Methods of unconditional minimization of functions using a simplex”, Issled. Prikl. Mat., 7 (1979),  55–64  mathnet  mathscinet  zmath; J. Soviet Math., 43:3 (1988), 2454–2460

Organisations
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024