Popov Leonid Denisovich

Publications in Math-Net.Ru

1. Barriers and symmetric regularization of the Lagrange function in the analysis of improper linear programming problems
   
   Trudy Inst. Mat. i Mekh. UrO RAN, 29:3 (2023),  138–155
2. On parameter control in iterative linear programming methods based on a new class of smooth exterior penalty functions
   
   Trudy Inst. Mat. i Mekh. UrO RAN, 28:4 (2022),  191–200
3. On one method of increasing the smoothness of external penalty functions in linear and convex programming
   
   Trudy Inst. Mat. i Mekh. UrO RAN, 27:4 (2021),  88–101
4. On iterative methods of finding the equilibrium in the Arrow-Debreu classical model of pure exchange with multiplicative utility functions of the participants
   
   Trudy Inst. Mat. i Mekh. UrO RAN, 26:3 (2020),  154–170
5. On a regularization method for improper linear programs
   
   Trudy Inst. Mat. i Mekh. UrO RAN, 25:1 (2019),  196–206
6. Interior Point Methods Adapted to Improper Linear Programs
   
   Trudy Inst. Mat. i Mekh. UrO RAN, 24:4 (2018),  208–216
7. Regularization methods and issues of lexicographic correction for convex programming problems with inconsistent constraints
   
   Trudy Inst. Mat. i Mekh. UrO RAN, 23:3 (2017),  214–223
8. Duality and correction of inconsistent constraints for improper linear programming problems
   
   Trudy Inst. Mat. i Mekh. UrO RAN, 22:3 (2016),  200–211
9. Lexicographic regularization and duality for improper linear programming problems
   
   Trudy Inst. Mat. i Mekh. UrO RAN, 21:3 (2015),  279–291
10. Experience in organizing hybrid parallel calculations in the Evtushenko–Golikov method for problems with block-angular structure
    
    Avtomat. i Telemekh., 2014, no. 4,  38–50
11. Dual approach to the application of barrier functions for the optimal correction of improper linear programming problems of the first kind
    
    Trudy Inst. Mat. i Mekh. UrO RAN, 20:1 (2014),  231–237
12. On the adaptation of the least squares method to improper problems of mathematical programming
    
    Trudy Inst. Mat. i Mekh. UrO RAN, 19:2 (2013),  247–255
13. Use of barrier functions for optimal correction of improper problems of linear programming of the 1st kind
    
    Avtomat. i Telemekh., 2012, no. 3,  3–11
14. Iterative methods for equilibrium search in the partial Arrow–Debreu–Stone exchange model
    
    Trudy Inst. Mat. i Mekh. UrO RAN, 18:3 (2012),  201–207
15. Interior penalty functions and duality in linear programming
    
    Trudy Inst. Mat. i Mekh. UrO RAN, 18:3 (2012),  83–89
16. Search of generalized solutions to improper linear and convex programming problems using barrier functions
    
    Bulletin of Irkutsk State University. Series Mathematics, 4:2 (2011),  134–146
17. Combined penalties and generalized solutions for improper problems of linear and convex programming of the first kind
    
    Trudy Inst. Mat. i Mekh. UrO RAN, 16:3 (2010),  217–226
18. Fejér processes in theory and practice: recent results
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 2009, no. 1,  44–65
19. Schemes of involving dual variables in inverse barrier functions for problems of linear and convex programming
    
    Trudy Inst. Mat. i Mekh. UrO RAN, 15:1 (2009),  195–207
20. Closed Fejér cycles for incompatible systems of convex inequalities
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 2008, no. 1,  11–19
21. One modification of the logarithmic barrier function method in linear and convex programming
    
    Trudy Inst. Mat. i Mekh. UrO RAN, 14:2 (2008),  103–114
22. Experience of multilevel parallelizing of the branch and bound method in discrete optimization problems
    
    Avtomat. i Telemekh., 2007, no. 5,  171–181
23. Quadratic approximation of penalty functions for solving large-scale linear programs
    
    Zh. Vychisl. Mat. Mat. Fiz., 47:2 (2007),  206–221
24. Distributed fejer processes for systems of linear inequalities and problems of linear programming
    
    Avtomat. i Telemekh., 2004, no. 2,  16–32
25. On schemes for the formation of a master sequence in a regularized extragradient method for solving variational inequalities
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 2004, no. 1,  70–79
26. Lexicographic variational inequalities and some applications
    
    Trudy Inst. Mat. i Mekh. UrO RAN, 8:1 (2002),  103–115
27. On a one-stage method for solving lexicographic variational inequalities
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 1998, no. 12,  71–81
28. About accuracy of the solution of internal subproblems in the Hestenes–Powell method
    
    Trudy Inst. Mat. i Mekh. UrO RAN, 5 (1998),  381–386
29. Two new schemes of application of the projection method to the problem of finding approximative roots of monotone operators
    
    Trudy Inst. Mat. i Mekh. UrO RAN, 4 (1996),  337–344
30. On the application of the projection method for finding approximate roots of monotone mappings
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 1995, no. 12,  74–80
31. Application of the modified prox-method to the optimal linear correction of improper convex programming problems
    
    Trudy Inst. Mat. i Mekh. UrO RAN, 3 (1995),  261–266
32. Approximate roots of unsolvable equations with monotone mappings in the left-hand side
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 1993, no. 12,  70–80
33. Linear correction of ill-posed convex-concave minimax problems on a maximin criterion
    
    Zh. Vychisl. Mat. Mat. Fiz., 26:9 (1986),  1325–1338
34. A modification of the Arrow–Hurwicz method for search of saddle points
    
    Mat. Zametki, 28:5 (1980),  777–784