RUS  ENG
Full version
PEOPLE

Skarin Vladimir Dmitrievich

Publications in Math-Net.Ru

  1. On the optimal correction of improper convex programming problems based on the method of quasi-solutions

    Trudy Inst. Mat. i Mekh. UrO RAN, 29:3 (2023),  168–184
  2. The Method of Quasi-Solutions Based on Barrier Functions in the Analysis of Improper Convex Programs

    Trudy Inst. Mat. i Mekh. UrO RAN, 28:4 (2022),  201–215
  3. The quasisolution method in the analysis of convex programs with singularities

    Trudy Inst. Mat. i Mekh. UrO RAN, 27:4 (2021),  125–141
  4. On the choice of parameters in the quasisolution method for the correction of improper convex programs

    Trudy Inst. Mat. i Mekh. UrO RAN, 26:3 (2020),  187–197
  5. On the application of the quasisolution method to the correction of improper convex programs

    Trudy Inst. Mat. i Mekh. UrO RAN, 25:4 (2019),  189–200
  6. The method of penalty functions and regularization in the analysis of improper convex programming problems

    Trudy Inst. Mat. i Mekh. UrO RAN, 24:3 (2018),  187–199
  7. On the construction of regularizing algorithms for the correction of improper convex programming problems

    Trudy Inst. Mat. i Mekh. UrO RAN, 23:3 (2017),  234–243
  8. 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
  9. On the choice of parameters in the residual method for optimal correction of improper problems of convex optimization

    Trudy Inst. Mat. i Mekh. UrO RAN, 22:3 (2016),  231–243
  10. Duality and correction of inconsistent constraints for improper linear programming problems

    Trudy Inst. Mat. i Mekh. UrO RAN, 22:3 (2016),  200–211
  11. Lexicographic regularization and duality for improper linear programming problems

    Trudy Inst. Mat. i Mekh. UrO RAN, 21:3 (2015),  279–291
  12. On the application of the residual method for the correction of inconsistent problems of convex programming

    Trudy Inst. Mat. i Mekh. UrO RAN, 20:2 (2014),  268–276
  13. On the optimal correction of contradictory problems of convex programming

    Trudy Inst. Mat. i Mekh. UrO RAN, 19:2 (2013),  267–274
  14. On some universal methods of correction of the improper convex programming problems

    Avtomat. i Telemekh., 2012, no. 2,  99–110
  15. On the application of a regularization method for the correction of improper problems of convex programming

    Trudy Inst. Mat. i Mekh. UrO RAN, 18:3 (2012),  230–241
  16. On one general approach to the optimal correction of improper convex programming problems

    Trudy Inst. Mat. i Mekh. UrO RAN, 16:3 (2010),  265–275
  17. Approximation and regularization properties of augmented penalty functions in convex programming

    Trudy Inst. Mat. i Mekh. UrO RAN, 15:4 (2009),  234–250
  18. Barrier function method and correction algorithms for improper convex programming problems

    Trudy Inst. Mat. i Mekh. UrO RAN, 14:2 (2008),  115–128
  19. Regularized Lagrange function and correction methods for improper convex programming problems

    Trudy Inst. Mat. i Mekh. UrO RAN, 8:1 (2002),  116–146
  20. On a regularization method for inconsistent convex programming problems

    Izv. Vyssh. Uchebn. Zaved. Mat., 1995, no. 12,  81–88
  21. An approach to the analysis of improper linear programming problems

    Zh. Vychisl. Mat. Mat. Fiz., 26:3 (1986),  439–448
  22. On the regularization of minimax problems that arise in convex programming

    Zh. Vychisl. Mat. Mat. Fiz., 17:6 (1977),  1408–1420
  23. On the method of penalty functions for nonlinear programming problems

    Dokl. Akad. Nauk SSSR, 209:6 (1973),  1292–1295
  24. The method of penalty functions for nonlinear programming problems

    Zh. Vychisl. Mat. Mat. Fiz., 13:5 (1973),  1186–1199


© Steklov Math. Inst. of RAS, 2024