Skip to main content
SpringerLink
Log in

Method of the generalized gradient for finding the absolute minimum of a convex function

  • Published:
Cybernetics Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. H. Busemann, Convex Surfaces, Wiley, New York (1958).

    Google Scholar 

  2. M. M. Vainberg, The Variational Method and the Method of Monotonic Operators [in Russian], Fizmatgiz, Moscow (1972).

    Google Scholar 

  3. E. G. Gol'shtein, “Generalized gradient method for finding saddle points” Ékonom. Mat. Metody,8, No. 4 (1972).

    Google Scholar 

  4. Yu. M. Ermol'ev, “Methods for solving nonlinear extremal problems,” Kibernetika, No. 4 (1966).

  5. B. T. Polyak, “A general method for solving extremal problems” Dok. Akad. Nauk SSSR174, No. 1 (1967).

    Google Scholar 

  6. Ch'ang Wang T'uk, “On certain iterative methods of block programming,” Candidate's Dissertation, Moscow (1972).

  7. N. Z. Shor, “Generalized gradient descent,” in: Proceedings of the First Winter School on Mathematical Programming, Drogobych [in Russian], Moscow (1969).

  8. N. Z. Shor, “On the structure of numerical algorithms for solving optimal planning and design problems,” Candidate's Dissertation, Institute of Cybernetics, Academy of Sciences of the Ukrainian SSR, Kiev (1964).

    Google Scholar 

  9. N. Z. Shor, “Methods for minimizing nondifferentiable functions,” Author's Abstract of Doctoral Dissertation, Kiev (1970).

Download references

Authors
  1. M. A. Shepilov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 4, pp. 52–57, July–August, 1976.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shepilov, M.A. Method of the generalized gradient for finding the absolute minimum of a convex function. Cybern Syst Anal 12, 547–553 (1976). https://doi.org/10.1007/BF01070389

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01070389

Keywords

Search

Navigation