Advertisement

Dual direction methods for function minimization

  • Yu. M. Danilin
Mathematical Programming And Numerical Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 27)

References

  1. 1.
    Yu.M.Danilin, B.N.Pshenichniy, On the Methods of Minimization with the Accelerated Convergence(Russian). Journal "Vychisl. Mat. i Mat. Phys.", 10, N 6, 1970.Google Scholar
  2. 2.
    Yu.M.Danilin, B.N.Pshenichniy, The Estimates for the Speed of Convergence of a Certain Class of Minimization Algorithms (Russian). Journal "Dokl. Akad. Nauk SSSR", t. 213, N 2, 1973.Google Scholar
  3. 3.
    Yu.M.Danilin, On a Certain Class of the Minimization Algorithms with Superlinear Convergence (Russian). Journal "Vychisl. Mat. i Mat. Phys.", 14, N 3, 1974.Google Scholar
  4. 4.
    D.H.Jacobson, Oksman W., An algorithm that minimizes homogeneous functions on N variables in N+2 iterations and rapidly minimizes general functions. J.Math. Anal. Applik., v.38, 1972.Google Scholar
  5. 5.
    H.Y.Huang, Method of Dual matrices for function minimization. JOTA, v. 13, N 5, 1974.Google Scholar
  6. 6.
    Yu.M.Danilin, The Methods of Conjugate Directions for the Minimization Problems Solution (Russian). Journal "Kibernetika", N 5, 1971.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • Yu. M. Danilin
    • 1
  1. 1.Institute of Cybernetics Ukrainan Academy of SciencesUSSR

Personalised recommendations