|
|
Publications in Math-Net.Ru
-
Computational methods in linear programming without using artificial variables
Izv. Vyssh. Uchebn. Zaved. Mat., 2008, no. 1, 20–26
-
Algorithms in the penalty method with approximation of the admissible set
Izv. Vyssh. Uchebn. Zaved. Mat., 2004, no. 1, 36–47
-
Control of the minimization process in the parametrized method of centers
Izv. Vyssh. Uchebn. Zaved. Mat., 2002, no. 12, 3–10
-
Algorithms in the method of centers with approximation of the set of admissible solutions
Izv. Vyssh. Uchebn. Zaved. Mat., 2001, no. 12, 41–45
-
On a modification of the penalty shifting method for nonlinear programming problems
Izv. Vyssh. Uchebn. Zaved. Mat., 2000, no. 12, 49–54
-
Algorithms in the method of centers with incomplete minimization of an auxiliary maximum function
Izv. Vyssh. Uchebn. Zaved. Mat., 1999, no. 12, 53–59
-
Algorithms with combination, parametrization and two-sided approximation in the center method
Izv. Vyssh. Uchebn. Zaved. Mat., 1998, no. 12, 40–48
-
The relaxation method for pseudoconvex programming problems of a certain type
Izv. Vyssh. Uchebn. Zaved. Mat., 1993, no. 12, 44–51
-
On the reduction of a quasiconvex programming problem to an unconditional minimization problem by the conic projection method
Izv. Vyssh. Uchebn. Zaved. Mat., 1992, no. 1, 3–7
-
A general method for determining a conditional minimax
Izv. Vyssh. Uchebn. Zaved. Mat., 1988, no. 1, 18–25
-
Relaxation method for constrained minimization of the maximum function
Issled. Prikl. Mat., 14 (1987), 25–34
-
Adaptive algorithms in the parametrized method of centers
Issled. Prikl. Mat., 14 (1987), 9–15
-
Construction of nonrelaxation subgradients of methods of unconditional minimization of convex functions
Izv. Vyssh. Uchebn. Zaved. Mat., 1983, no. 2, 41–48
-
On the convergence of methods for finding the minimax
Izv. Vyssh. Uchebn. Zaved. Mat., 1977, no. 10, 56–64
-
A class of quasiconcave functionals and the optimal redundancy problem
Issled. Prikl. Mat., 4 (1977), 11–14
-
Computation of cones of generalized supporting functionals
Issled. Prikl. Mat., 4 (1977), 3–10
-
Counter-examples to Zoutendijk's algorithms in methods of feasible directions
Izv. Vyssh. Uchebn. Zaved. Mat., 1976, no. 11, 32–37
-
The minimax method for the solution of a mathematical programming problem
Izv. Vyssh. Uchebn. Zaved. Mat., 1975, no. 6, 36–43
-
Pseudoconvex functionals, and their extremal properties
Izv. Vyssh. Uchebn. Zaved. Mat., 1974, no. 4, 27–31
-
Sufficient conditions for a global minimum in a nonlinear programming problem
Issled. Prikl. Mat., 1 (1973), 103–108
-
The problem of determining the optimal production run
Issled. Prikl. Mat., 1 (1973), 3–14
-
The minimization of quasicomplex functionals
Izv. Vyssh. Uchebn. Zaved. Mat., 1972, no. 10, 27–33
-
A modification of the gradient projection method for a convex programming problem
Uchenye Zapiski Kazanskogo Universiteta, 129:4 (1969), 32–39
-
Discrete mathematical programming
Uchenye Zapiski Kazanskogo Universiteta, 127:3 (1967), 74–81
-
Some statements of a problem of rational cutting of industrial materials
Uchenye Zapiski Kazanskogo Universiteta, 125:6 (1965), 72–73
-
Numerical method of dynamic programming of a problem of optimal reservation
Uchenye Zapiski Kazanskogo Universiteta, 125:6 (1965), 69–71
-
A certain sufficient condition for the existence and uniqueness of a solution of the basic functional equation of dynamic programming
Uchenye Zapiski Kazanskogo Universiteta, 125:6 (1965), 67–68
-
On transitive imprimitive groups with radical in four-dimensional complex space
Izv. Vyssh. Uchebn. Zaved. Mat., 1958, no. 6, 73–85
-
Semisimple transitive imprimitive groups of four-dimensional complex space
Izv. Vyssh. Uchebn. Zaved. Mat., 1958, no. 4, 67–79
-
Albert Valentinovich Sul'din (obituary)
Izv. Vyssh. Uchebn. Zaved. Mat., 1996, no. 2, 84
-
XXVI Congress of the CPSU and problems of scientific and technological progress
Izv. Vyssh. Uchebn. Zaved. Mat., 1981, no. 4, 3–4
-
Al'bert Valentinovich Sul'din (on the occasion of his fiftieth birthday)
Izv. Vyssh. Uchebn. Zaved. Mat., 1978, no. 12, 3–5
© , 2026