methods of feasible directions,
projecting methods,
methods of linear separation of convex polyhedra,
linear inequalities systems solving,
variational inequalities,
support vector,
separation margin.
UDC:
519.8, 519.85, 519.853, 519.852
Subject:
Mathematical Programming. Operational Research.
Main publications:
Z. R. Gabidullina, “A theorem on separability of a convex polyhedron from zero point of the space and its applications in optimization”, Izv. Vyssh. Uchebn. Zaved. Mat., 2006, no. 12, 21–26; Russian Math. (Iz. VUZ), 50:12 (2006), 18–23
Z. R. Gabidullina, Ya. I. Zabotin, “The relaxation method for pseudoconvex programming problems of a certain type”, Izv. Vyssh. Uchebn. Zaved. Mat., 1993, no. 12, 44–51; Russian Math. (Iz. VUZ), 37:12 (1993), 44–51
Z. R. Gabidullina, “A theorem on separability of a convex polyhedron from zero point of the space and its applications in optimization”, Izv. Vyssh. Uchebn. Zaved. Mat., 2006, no. 12, 21–26; Russian Math. (Iz. VUZ), 50:12 (2006), 18–23
Z. R. Gabidullina, Ya. I. Zabotin, “The relaxation method for pseudoconvex programming problems of a certain type”, Izv. Vyssh. Uchebn. Zaved. Mat., 1993, no. 12, 44–51; Russian Math. (Iz. VUZ), 37:12 (1993), 44–51
Z. R. Gabidullina, “Relaxation methods with step regulation for solving constrained optimization problems”, Issled. Prikl. Mat., 18 (1992), 30–38; J. Math. Sci., 73:5 (1995), 538–543
Z. R. Gabidullina, “Reduced-gradient method for minimization of a nonsmooth quasiconvex function”, Issled. Prikl. Mat., 16 (1989), 97–101; J. Soviet Math., 61:6 (1992), 2456–2458
1988
5.
Z. R. Gabidullina, “Differentiability of a convex function”, Issled. Prikl. Mat., 15 (1988), 3–5; J. Soviet Math., 61:5 (1992), 2319–2320
1987
6.
Z. R. Gabidullina, “Convergence of the constrained gradient method for a class of nonconvex functions”, Issled. Prikl. Mat., 14 (1987), 15–25; J. Soviet Math., 50:5 (1990), 1803–1809
Contact us: