Kaplan Aleksandr Avramovich

Publications in Math-Net.Ru

1. Adaptive methods for solving ill-posed semi-infinite problems of convex optimization
   
   Dokl. Akad. Nauk, 322:3 (1992),  460–464
2. Investigation of iterative processes for solving ill-posed convex variational problems
   
   Dokl. Akad. Nauk SSSR, 315:2 (1990),  275–278
3. Convergence of methods for solving variational inequalities with weakly coercive operators
   
   Dokl. Akad. Nauk SSSR, 310:1 (1990),  20–24
4. Stable algorithms for the penalty method
   
   Dokl. Akad. Nauk SSSR, 299:1 (1988),  38–42
5. Stability of methods for solving convex programming problems and variational inequalities
   
   Trudy Inst. Mat. Sib. Otd. AN SSSR, 10 (1988),  132–159
6. On a characteristic of minimizing sequences for the Signorini problem
   
   Dokl. Akad. Nauk SSSR, 273:4 (1983),  797–800
7. Algorithms for convex programming using smoothing of exact penalty functions
   
   Sibirsk. Mat. Zh., 23:4 (1982),  53–64
8. On an approach to the solution of convex programming problems
   
   Dokl. Akad. Nauk SSSR, 258:4 (1981),  785–788
9. Iteration processes of convex programming with inner regularization
   
   Sibirsk. Mat. Zh., 20:2 (1979),  307–316
10. On a convex programming method with internal regularization
    
    Dokl. Akad. Nauk SSSR, 241:1 (1978),  22–25
11. On the convergence of the penalty function method
    
    Dokl. Akad. Nauk SSSR, 229:2 (1976),  288–291
12. A remark on the Stone–Weierstrass theorem
    
    Sibirsk. Mat. Zh., 16:5 (1975),  1113–1115
13. Some applications of mathematical programming to problems of mathematical physics
    
    Sibirsk. Mat. Zh., 15:5 (1974),  1163–1170
14. Characteristic properties of penalty functions
    
    Dokl. Akad. Nauk SSSR, 210:5 (1973),  1018–1021
15. On the Kuhn–Tucker theorem
    
    Dokl. Akad. Nauk SSSR, 188:5 (1969),  993–996
16. Finding the extremum of a linear function on a convex set
    
    Dokl. Akad. Nauk SSSR, 178:6 (1968),  1245–1247