|
|
Publications in Math-Net.Ru
-
Methods of Chebyshev points of convex sets and their applications
Avtomat. i Telemekh., 2008, no. 4, 168–175
-
Efficient methods for solving convex programming problems that apply embedding of admissible set in simplexes
Diskretn. Anal. Issled. Oper., 15:3 (2008), 3–10
-
Methods of support cones and simplices in convex programming and their applications to physicochemical systems
Zh. Vychisl. Mat. Mat. Fiz., 48:11 (2008), 1952–1967
-
Method of orthogonal simplexes and its applications to convex programming
Zh. Vychisl. Mat. Mat. Fiz., 48:4 (2008), 610–622
-
Methods of Chebyshev points of convex sets and their applications
Zh. Vychisl. Mat. Mat. Fiz., 48:1 (2008), 18–32
-
Numerical solution methods for multiextremal problems connected with inverse problems in mathematical programming
Izv. Vyssh. Uchebn. Zaved. Mat., 2007, no. 6, 14–20
-
Cutting methods in $E^{n+1}$ for global optimization of a class of functions
Zh. Vychisl. Mat. Mat. Fiz., 47:11 (2007), 1830–1842
-
Global optimization and methods for finding all the roots of systems of nonlinear algebraic equations
Diskretn. Anal. Issled. Oper., Ser. 2, 13:1 (2006), 3–9
-
On an efficient method for convex programming
Diskretn. Anal. Issled. Oper., Ser. 2, 11:1 (2004), 51–61
-
Numerical methods for finding all real roots of systems of nonlinear equations
Zh. Vychisl. Mat. Mat. Fiz., 40:3 (2000), 348–355
-
An algorithm of simplex imbeddings in convex programming
Zh. Vychisl. Mat. Mat. Fiz., 27:3 (1987), 377–384
© , 2026