Chernyaev Yu A

Publications in Math-Net.Ru

1. Conditional gradient method for optimization problems with a constraint in the form of the intersection of a convex smooth surface and a convex compact set
   
   Zh. Vychisl. Mat. Mat. Fiz., 63:7 (2023),  1100–1107
2. Numerical algorithm for solving a class of optimization problems with a constraint in the form of a subset of points of a smooth surface
   
   Zh. Vychisl. Mat. Mat. Fiz., 62:12 (2022),  2018–2025
3. Gradient projection method for a class of optimization problems with a constraint in the form of a subset of points of a smooth surface
   
   Zh. Vychisl. Mat. Mat. Fiz., 61:3 (2021),  391–399
4. Numerical algorithm for minimizing a convex function on the intersection of a smooth surface and a convex compact set
   
   Zh. Vychisl. Mat. Mat. Fiz., 59:7 (2019),  1151–1157
5. Gradient projection method for optimization problems with a constraint in the form of the intersection of a smooth surface and a convex closed set
   
   Zh. Vychisl. Mat. Mat. Fiz., 59:1 (2019),  37–49
6. Newton's method for minimizing a convex twice differentiable function on a preconvex set
   
   Zh. Vychisl. Mat. Mat. Fiz., 58:3 (2018),  340–345
7. Iterative algorithm for minimizing a convex function at the intersection of a spherical surface and a convex compact set
   
   Zh. Vychisl. Mat. Mat. Fiz., 57:10 (2017),  1631–1640
8. Convergence of the gradient projection method and Newton's method as applied to optimization problems constrained by intersection of a spherical surface and a convex closed set
   
   Zh. Vychisl. Mat. Mat. Fiz., 56:10 (2016),  1733–1749
9. Numerical algorithm for solving mathematical programming problems with a smooth surface as a constraint
   
   Zh. Vychisl. Mat. Mat. Fiz., 56:3 (2016),  387–393
10. An extension of the gradient projection method and Newton's method to extremum problems constrained by a smooth surface
    
    Zh. Vychisl. Mat. Mat. Fiz., 55:9 (2015),  1493–1502
11. Newton’s method for optimization problems with a convex smooth surface as a constraint
    
    Zh. Vychisl. Mat. Mat. Fiz., 52:2 (2012),  224–230
12. Iterative algorithm for mathematical programming problems with preconvex constraints
    
    Zh. Vychisl. Mat. Mat. Fiz., 50:5 (2010),  832–835
13. An iterative method for minimizing a convex nonsmooth function on a convex smooth surface
    
    Zh. Vychisl. Mat. Mat. Fiz., 49:4 (2009),  611–615
14. Generalization of Newton's method to the class of nonconvex mathematical programming problems
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 2008, no. 1,  78–82
15. Two methods for minimizing convex functions in a class of nonconvex sets
    
    Zh. Vychisl. Mat. Mat. Fiz., 48:10 (2008),  1802–1811
16. An extension of the conditional gradient method to a class of nonconvex optimization problems
    
    Zh. Vychisl. Mat. Mat. Fiz., 46:4 (2006),  576–582
17. Convergence of the gradient projection method for a class of nonconvex mathematical programming problems
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 2005, no. 12,  76–79
18. Two algorithms for solving a mathematical programming problem with preconvex constraints
    
    Zh. Vychisl. Mat. Mat. Fiz., 44:7 (2004),  1229–1233
19. Convergence of an iterative method for a programming problem, which is constrained by a convex smooth surface
    
    Zh. Vychisl. Mat. Mat. Fiz., 44:4 (2004),  609–612
20. The conditional gradient method for optimization problems with pre-convex constrains
    
    Zh. Vychisl. Mat. Mat. Fiz., 43:12 (2003),  1910–1913
21. On a numerical algorithm for optimization problems with pre-convex constraints
    
    Zh. Vychisl. Mat. Mat. Fiz., 43:2 (2003),  169–175
22. A generalization of the gradient projection method to extremal problems with preconvex constraints
    
    Zh. Vychisl. Mat. Mat. Fiz., 41:3 (2001),  367–373