Danilin Yu M

Publications in Math-Net.Ru

1. Quadratic penalty methods based on linear approximation
   
   Zh. Vychisl. Mat. Mat. Fiz., 29:6 (1989),  831–843
2. Newton's method with step control for degenerate minimization problems
   
   Dokl. Akad. Nauk SSSR, 259:3 (1981),  530–532
3. Quasi-Newtonian minimization algorithms that are based on the construction of systems of conjugate vectors
   
   Zh. Vychisl. Mat. Mat. Fiz., 18:4 (1978),  877–885
4. Conjugate gradient methods that do not require the solution of one- dimensional minimization problems
   
   Dokl. Akad. Nauk SSSR, 218:3 (1974),  513–516
5. A certain class of minimization algorithms with superlinear convergence
   
   Zh. Vychisl. Mat. Mat. Fiz., 14:3 (1974),  598–609
6. Estimates of the rate of convergence of a class of minimization algorithms
   
   Dokl. Akad. Nauk SSSR, 213:2 (1973),  270–273
7. Estimation of the effectiveness of a certain algorithm for finding the absolute minimum
   
   Zh. Vychisl. Mat. Mat. Fiz., 11:4 (1971),  1026–1031
8. A minimization method without the calculation of derivatives
   
   Zh. Vychisl. Mat. Mat. Fiz., 11:1 (1971),  12–21
9. On methods of minimization with accelerated convergence
   
   Zh. Vychisl. Mat. Mat. Fiz., 10:6 (1970),  1341–1354
10. Minimization methods that are based on the approximations of the initial functional by convex ones
    
    Zh. Vychisl. Mat. Mat. Fiz., 10:5 (1970),  1067–1080
11. A certain approach to minimization problems
    
    Dokl. Akad. Nauk SSSR, 188:6 (1969),  1221–1222