|
|
Publications in Math-Net.Ru
-
A general method for finding the direction of descent in $\varepsilon$-subgradient methods
Issled. Prikl. Mat., 20 (1992), 50–58
-
One approach to designing numerically implementable algorithms of the $\varepsilon$-subgradient method
Issled. Prikl. Mat., 10 (1984), 76–81
-
The method of the conditional $\varepsilon$-subgradient
Izv. Vyssh. Uchebn. Zaved. Mat., 1983, no. 9, 22–26
-
Numerical solution of sample minimization problems by the $\varepsilin$-subgradient method
Issled. Prikl. Mat., 8 (1980), 9–14
-
Relaxation methods of minimization of pseudoconvex functions
Issled. Prikl. Mat., 8 (1980), 3–8
-
A method for the determination of the minimax
Issled. Prikl. Mat., 7 (1979), 19–23
-
A certain algorithm of the $\varepsilon$-subgradient minimization method and its application
Issled. Prikl. Mat., 7 (1979), 12–18
-
$\varepsilon$-Subgradient method for the solution of nonlinear extremal problems
Issled. Prikl. Mat., 7 (1979), 3–11
-
Relaxation methods for minimizing pseudoconvex functions
Izv. Vyssh. Uchebn. Zaved. Mat., 1978, no. 10, 99–101
-
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 minimization of quasicomplex functionals
Izv. Vyssh. Uchebn. Zaved. Mat., 1972, no. 10, 27–33
© , 2026